Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
