Abstract
Problems arising on Urban Waste Management are broad and varied. This paper is focused on designing collection routes for urban wastes, a problem existing in most European waste collection systems. The relationship between the real world problem and the Arc Routing literature is established, and the Capacitated Arc Routing Problem is extended to comply with traffic rules. Afterwards, an Ant Algorithm is designed to solve this problem, and its efficiency is tested using the instance sets from the CARP literature and a set of real life instances from the Metropolitan Area of Barcelona. Finally, the integration between the proposed algorithms and a Decision Support System for Urban Waste Management is shown. © 2004 Springer-Verlag.
Cite
CITATION STYLE
Bautista, J., & Pereira, J. (2004). Ant algorithms for urban waste collection routing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3172 LNCS, pp. 302–309). Springer Verlag. https://doi.org/10.1007/978-3-540-28646-2_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
