Abstract
The optimization of solid waste collection circuits is one of the applications of the Capacited Arc Routing Problem. This article addresses this topic, summarizes and compares the different research and methods that have been used to solve this famous problem. And concluded with an effective method on which will be based the design of a computer optimization tool.
Highlights
The problem of solid waste collection is one of the most serious issues of concern to communities and garbage collection companies
Logistics and waste transport are an essential element of this waste management in the same way as their methods of recovery or disposal, because of the mass and volumes concerned, the technical means put in place, the costs generated, or the energy consumption and emissions of pollutants generated
This problem is well known in operations research under the name of the Chinese Postman Problem (CPP)
Summary
The problem of solid waste collection is one of the most serious issues of concern to communities and garbage collection companies. Logistics and waste transport are an essential element of this waste management in the same way as their methods of recovery or disposal, because of the mass and volumes concerned, the technical means put in place, the costs generated, or the energy consumption and emissions of pollutants generated The optimization of this management is the optimization of waste collection circuits. The road network is represented by a graph in which each arc or edge (street) must be served at least once, the objective is to find a minimum cost cycle (or circuit) passing at least once through each arc or edge of the graph This problem is well known in operations research under the name of the Chinese Postman Problem (CPP).
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
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 call
