Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study

Jose Carlos Molina (), Ignacio Eguia () and Jesus Racero ()
Additional contact information
Jose Carlos Molina: Universidad de Sevilla
Ignacio Eguia: Universidad de Sevilla
Jesus Racero: Universidad de Sevilla

TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, 2019, vol. 27, issue 2, No 9, 253-287

Abstract: Abstract 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.

Keywords: Waste collection vehicle routing problem; Variable neighborhood tabu search; COPERT model equations; Pollutant emissions; 90B06 (Transportation logistics); 90C11 (Mixed-integer programming); 90C59 (Approximation methods and heuristics) (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://link.springer.com/10.1007/s11750-019-00505-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:topjnl:v:27:y:2019:i:2:d:10.1007_s11750-019-00505-5

Ordering information: This journal article can be ordered from
http://link.springer.de/orders.htm

DOI: 10.1007/s11750-019-00505-5

Access Statistics for this article

TOP: An Official Journal of the Spanish Society of Statistics and Operations Research is currently edited by Juan José Salazar González and Gustavo Bergantiños

More articles in TOP: An Official Journal of the Spanish Society of Statistics and Operations Research from Springer, Sociedad de Estadística e Investigación Operativa
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().