**Elisabete Alberdi 1,\*,†, Leire Urrutia 1,†, Aitor Goti 2,† and Aitor Oyarbide-Zubillaga 3,†**


Received: 12 March 2020; Accepted: 21 April 2020; Published: 27 April 2020

**Abstract:** Calculating adequate vehicle routes for collecting municipal waste is still an unsolved issue, even though many solutions for this process can be found in the literature. A gap still exists between academics and practitioners in the field. One of the apparent reasons why this rift exists is that academic tools often are not easy to handle and maintain by actual users. In this work, the problem of municipal waste collection is modeled using a simple but efficient and especially easy to maintain solution. Real data have been used, and it has been solved using a Genetic Algorithm (GA). Computations have been done in two different ways: using a complete random initial population, and including a seed in this initial population. In order to guarantee that the solution is efficient, the performance of the genetic algorithm has been compared with another well-performing algorithm, the Variable Neighborhood Search (VNS). Three problems of different sizes have been solved and, in all cases, a significant improvement has been obtained. A total reduction of 40% of itineraries is attained with the subsequent reduction of emissions and costs.

**Keywords:** waste collection route planning; traveling salesman problem; genetic algorithms
