1. Repositório Institucional da UFMG
2. Trabalhos Acadêmicos
3. Dissertações e Teses
4. Pós-Graduação em Ciência da Computação
5. Teses de Doutorado

Tipo:	Tese de Doutorado
Título:	Robust covering problems: formulations, algorithms and application
Autor(es):	Amadeu Almeida Coco
primer Tutor:	Thiago Ferreira de Noronha
primer Co-tutor:	Andrea Cynthia Santos
primer miembro del tribunal :	Andrea Cynthia Santos
Segundo miembro del tribunal:	Sebastián Alberto Urrutia
Tercer miembro del tribunal:	Christophe Duhamel
Cuarto miembro del tribunal:	Philippe Yves Paul Michelon
Resumen:	Two robust optimization NP-Hard problems are studied in this thesis: the min-max regret WSCP and the min-max regret MCLP. The uncertain data in these problems is modeled by intervals and only the minimum and maximum values for each interval are known. While the min-max regret WSCP is still a theoretical problem, the min-max regret MCLP has an application in disaster logistics which is investigated in this thesis. Four mathematical formulations, three exact algorithms and five heuristics were developed and applied to both problems. Computational experiments showed that the exact algorithms efficiently solved 14 out of 75 instances generated to the min-max regret WSCP and all realistic instances created to the min-max regret MCLP. For the simulated instances that was not solved to optimally in both problems, the heuristics developed in this thesis found solutions, as good as, or better than the best exact algorithm in almost all instance.
Asunto:	Algorítmos Logística Otimização combinatória Pesquisa operacional Computação Meta-heurísticas
Idioma:	Português
Editor:	Universidade Federal de Minas Gerais
Sigla da Institución:	UFMG
Tipo de acceso:	Acesso Aberto
URI:	http://hdl.handle.net/1843/ESBF-AYUMW2
Fecha del documento:	6-oct-2017
Aparece en las colecciones:	Teses de Doutorado

Los elementos en el repositorio están protegidos por copyright, con todos los derechos reservados, salvo cuando es indicado lo contrario.