METAHEURISTICS FOR THE WASTE COLLECTION VEHICLE ROUTING PROBLEM IN URBAN AREAS

This paper presents a methodology for solving the municipal waste collection problem in urban areas. The problem is treated as a distance-constrained capacitated vehicle routing problem for municipal waste collection (DCCVRP-MWC). To solve this problem, four meta-heuristic algorithms were used: Genetic algorithm (GA), Simulated annealing (SA), Particle swarm optimization (PSO) and Ant colony optimization (ACO). Vehicle guidance plays a huge role in large transportation companies, and with this test, we propose one of several algorithms for solving urban waste collection problems.