Metaheuristics for household refuse collection
Event Title
Euro XXV - 25th European Conference on Operational Research
Year (definitive publication)
2012
Language
English
Country
Lithuania
More Information
Web of Science®
This publication is not indexed in Web of Science®
Scopus
This publication is not indexed in Scopus
Google Scholar
Abstract
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.
Acknowledgements
--
Keywords
Metaheuristics, Routing, Transportation and Logistics