Robust covering problems: formulations, algorithms and application
Autor(a) principal: | |
---|---|
Data de Publicação: | 2017 |
Tipo de documento: | Tese |
Idioma: | por |
Título da fonte: | Repositório Institucional da UFMG |
Texto Completo: | http://hdl.handle.net/1843/ESBF-AYUMW2 |
Resumo: | 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. |
id |
UFMG_ec0856885132f6a3cba8c11e76e2330d |
---|---|
oai_identifier_str |
oai:repositorio.ufmg.br:1843/ESBF-AYUMW2 |
network_acronym_str |
UFMG |
network_name_str |
Repositório Institucional da UFMG |
repository_id_str |
|
spelling |
Thiago Ferreira de NoronhaAndrea Cynthia SantosAndrea Cynthia SantosSebastián Alberto UrrutiaChristophe DuhamelPhilippe Yves Paul MichelonAmadeu Almeida Coco2019-08-10T00:29:42Z2019-08-10T00:29:42Z2017-10-06http://hdl.handle.net/1843/ESBF-AYUMW2Two 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.Universidade Federal de Minas GeraisUFMGAlgorítmosLogísticaOtimização combinatóriaPesquisa operacionalComputaçãoMeta-heurísticasAlgoritmosLogísticaMeta-heurísticasPesquisa OperacionalOtimização CombinatóriaRobust covering problems: formulations, algorithms and applicationinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/doctoralThesisinfo:eu-repo/semantics/openAccessporreponame:Repositório Institucional da UFMGinstname:Universidade Federal de Minas Gerais (UFMG)instacron:UFMGORIGINALamadeualmeidacoco.pdfapplication/pdf991917https://repositorio.ufmg.br/bitstream/1843/ESBF-AYUMW2/1/amadeualmeidacoco.pdff2117384aa81cc49f754f1f670c7c427MD51TEXTamadeualmeidacoco.pdf.txtamadeualmeidacoco.pdf.txtExtracted texttext/plain293078https://repositorio.ufmg.br/bitstream/1843/ESBF-AYUMW2/2/amadeualmeidacoco.pdf.txte3ac2eeda18e2dab3849aba9117f617dMD521843/ESBF-AYUMW22019-11-14 08:33:51.673oai:repositorio.ufmg.br:1843/ESBF-AYUMW2Repositório de PublicaçõesPUBhttps://repositorio.ufmg.br/oaiopendoar:2019-11-14T11:33:51Repositório Institucional da UFMG - Universidade Federal de Minas Gerais (UFMG)false |
dc.title.pt_BR.fl_str_mv |
Robust covering problems: formulations, algorithms and application |
title |
Robust covering problems: formulations, algorithms and application |
spellingShingle |
Robust covering problems: formulations, algorithms and application Amadeu Almeida Coco Algoritmos Logística Meta-heurísticas Pesquisa Operacional Otimização Combinatória Algorítmos Logística Otimização combinatória Pesquisa operacional Computação Meta-heurísticas |
title_short |
Robust covering problems: formulations, algorithms and application |
title_full |
Robust covering problems: formulations, algorithms and application |
title_fullStr |
Robust covering problems: formulations, algorithms and application |
title_full_unstemmed |
Robust covering problems: formulations, algorithms and application |
title_sort |
Robust covering problems: formulations, algorithms and application |
author |
Amadeu Almeida Coco |
author_facet |
Amadeu Almeida Coco |
author_role |
author |
dc.contributor.advisor1.fl_str_mv |
Thiago Ferreira de Noronha |
dc.contributor.advisor-co1.fl_str_mv |
Andrea Cynthia Santos |
dc.contributor.referee1.fl_str_mv |
Andrea Cynthia Santos |
dc.contributor.referee2.fl_str_mv |
Sebastián Alberto Urrutia |
dc.contributor.referee3.fl_str_mv |
Christophe Duhamel |
dc.contributor.referee4.fl_str_mv |
Philippe Yves Paul Michelon |
dc.contributor.author.fl_str_mv |
Amadeu Almeida Coco |
contributor_str_mv |
Thiago Ferreira de Noronha Andrea Cynthia Santos Andrea Cynthia Santos Sebastián Alberto Urrutia Christophe Duhamel Philippe Yves Paul Michelon |
dc.subject.por.fl_str_mv |
Algoritmos Logística Meta-heurísticas Pesquisa Operacional Otimização Combinatória |
topic |
Algoritmos Logística Meta-heurísticas Pesquisa Operacional Otimização Combinatória Algorítmos Logística Otimização combinatória Pesquisa operacional Computação Meta-heurísticas |
dc.subject.other.pt_BR.fl_str_mv |
Algorítmos Logística Otimização combinatória Pesquisa operacional Computação Meta-heurísticas |
description |
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. |
publishDate |
2017 |
dc.date.issued.fl_str_mv |
2017-10-06 |
dc.date.accessioned.fl_str_mv |
2019-08-10T00:29:42Z |
dc.date.available.fl_str_mv |
2019-08-10T00:29:42Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/doctoralThesis |
format |
doctoralThesis |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/1843/ESBF-AYUMW2 |
url |
http://hdl.handle.net/1843/ESBF-AYUMW2 |
dc.language.iso.fl_str_mv |
por |
language |
por |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.publisher.none.fl_str_mv |
Universidade Federal de Minas Gerais |
dc.publisher.initials.fl_str_mv |
UFMG |
publisher.none.fl_str_mv |
Universidade Federal de Minas Gerais |
dc.source.none.fl_str_mv |
reponame:Repositório Institucional da UFMG instname:Universidade Federal de Minas Gerais (UFMG) instacron:UFMG |
instname_str |
Universidade Federal de Minas Gerais (UFMG) |
instacron_str |
UFMG |
institution |
UFMG |
reponame_str |
Repositório Institucional da UFMG |
collection |
Repositório Institucional da UFMG |
bitstream.url.fl_str_mv |
https://repositorio.ufmg.br/bitstream/1843/ESBF-AYUMW2/1/amadeualmeidacoco.pdf https://repositorio.ufmg.br/bitstream/1843/ESBF-AYUMW2/2/amadeualmeidacoco.pdf.txt |
bitstream.checksum.fl_str_mv |
f2117384aa81cc49f754f1f670c7c427 e3ac2eeda18e2dab3849aba9117f617d |
bitstream.checksumAlgorithm.fl_str_mv |
MD5 MD5 |
repository.name.fl_str_mv |
Repositório Institucional da UFMG - Universidade Federal de Minas Gerais (UFMG) |
repository.mail.fl_str_mv |
|
_version_ |
1803589233162584064 |