Ciência-IUL
Comunicações
Descrição Detalhada da Comunicação
Metaheuristics for household refuse collection
Título Evento
Euro XXV - 25th European Conference on Operational Research
Ano (publicação definitiva)
2012
Língua
Inglês
País
Lituânia
Mais Informação
Web of Science®
Esta publicação não está indexada na Web of Science®
Scopus
Esta publicação não está indexada na Scopus
Google Scholar
Abstract/Resumo
The household refuse collection in large urban areas may be modeled by the sectoring-arc routing problem (SARP). The SARP groups two families of problems: sectoring (or districting) problems and capacitated arc routing problems (CARP). The SARP is defined over a mixed graph. Its aim is to identify a given number of similar sectors (sub-graphs) and to build a set of collecting trips in each sector, such that the total duration of the trips is minimized. Metaheuristics are presented, and computational results over a set of benchmark instances are reported.
Agradecimentos/Acknowledgements
--
Palavras-chave
Metaheuristics, Routing, Transportation and Logistics