Robust covering problems: formulations, algorithms and application

Amadeu Almeida Coco

Please use this identifier to cite or link to this item: http://hdl.handle.net/1843/ESBF-AYUMW2

Type:	Tese de Doutorado
Title:	Robust covering problems: formulations, algorithms and application
Authors:	Amadeu Almeida Coco
First Advisor:	Thiago Ferreira de Noronha
First Co-advisor:	Andrea Cynthia Santos
First Referee:	Andrea Cynthia Santos
Second Referee:	Sebastián Alberto Urrutia
Third Referee:	Christophe Duhamel
metadata.dc.contributor.referee4:	Philippe Yves Paul Michelon
Abstract:	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.
Subject:	Algorítmos Logística Otimização combinatória Pesquisa operacional Computação Meta-heurísticas
language:	Português
Publisher:	Universidade Federal de Minas Gerais
Publisher Initials:	UFMG
Rights:	Acesso Aberto
URI:	http://hdl.handle.net/1843/ESBF-AYUMW2
Issue Date:	6-Oct-2017
Appears in Collections:	Teses de Doutorado

Files in This Item:

File	Description	Size	Format
amadeualmeidacoco.pdf		968.67 kB	Adobe PDF	View/Open

Show full item record