Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study
-
Jose Carlos Molina [1] ; Ignacio Eguia [1] ; Jesus Racero [1]
-
[1] Universidad de Sevilla
Universidad de Sevilla
Sevilla, España
-
- Localización: Top, ISSN-e 1863-8279, ISSN 1134-5764, Vol. 27, Nº. 2, 2019, págs. 253-287
- Idioma: inglés
- DOI: 10.1007/s11750-019-00505-5
- Enlaces
-
Resumen
This paper focuses on designing waste collection routes with a single landfill using eco-efficiency as a performance indicator. In this problem, there are a limited number of heterogeneous vehicles based at a single depot. Empty vehicles leave the depot, collect waste from a set of locations and drop off the collected waste at a specific landfill. Then, vehicles leave the landfill and may collect more waste from other locations or return empty to the depot. Traditional performance indicators in vehicle routing problems are mainly focused on economic objectives, not explicitly considering environmental issues. In this paper, a mathematical model is presented with an eco-efficient objective function that takes into account external costs (climate change and air pollution). The COPERT model is used for estimating fuel consumption, carbon dioxide and pollutant emissions. The problem is first heuristically solved using a semi-parallel construction algorithm. Then, solutions are improved by a variable neighborhood tabu search algorithm developed for this problem. The algorithm is validated for a real problem in the municipality of Alcalá de Guadaíra, within the metropolitan area of Seville (Spain). Results obtained on a set of case studies improve the solution that is currently implemented in the municipality, in terms of total distance traveled, carbon dioxide emissions and pollutant emissions.
