Solid Waste Collection In Ciudad Universitaria-Unam Using A Vrp Approach And Max-Min Ant System Algorithm

The collection of solid waste is a very important problem for most of the modern cities of the world. The solution to this problem requires to apply optimization techniques capable of design the best path routes that guarantee to collect all the waste minimizing the cost. Several computation techniques could be applied to solve this problem and one of the most suitable could be swarm optimization such as ant colony optimization. In this paper, we propose a methodology for searching a set of collection paths of solid waste that optimize the distance of a tour in Ciudad Universitaria (UNAM). This methodology uses a vehicle routing problem (VRP) approach combined with Max-Min Ant System algorithm. To assess the accuracy of the proposal, we select the scholar circuit in the area of Ciudad Universitaria. The results shown a shortest distance travelled and better distribution than the empiric route used actually for the cleaning service.