Summary
Solid waste collection in urban areas is a central topic for local environmental agencies. The operational problem, the definition of collection routes given the vehicle fleet, can greatly benefit of computerized support already for medium sized town. While the operational constraints can vary, the core problem can be identified as a capacitated arc routing problem on large directed graphs (DCARP). This paper reports about the effectiveness of different metaheuristics on large DCARP instances derived from real-world applications.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Maniezzo, V., Roffilli, M. (2008). Algorithms for Large Directed Capacitated Arc Routing Problem Instances. In: Cotta, C., van Hemert, J. (eds) Recent Advances in Evolutionary Computation for Combinatorial Optimization. Studies in Computational Intelligence, vol 153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70807-0_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-70807-0_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70806-3
Online ISBN: 978-3-540-70807-0
eBook Packages: EngineeringEngineering (R0)