Algorithms for Large Directed Capacitated Arc Routing Problem Instances
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.
KeywordsCombinatorial Optimization Capacitated Arc Routing Problem Reduction Metaheuristics Data Perturbation Garbage Collection
Unable to display preview. Download preview PDF.