An adaptive large neighborhood search heuristic for the Pollution-Routing Problem

Emrah Demir, Tolga Bektaş and Gilbert Laporte

European Journal of Operational Research, 2012, vol. 223, issue 2, 346-359

Abstract: The Pollution-Routing Problem (PRP) is a recently introduced extension of the classical Vehicle Routing Problem with Time Windows which consists of routing a number of vehicles to serve a set of customers, and determining their speed on each route segment so as to minimize a function comprising fuel, emission and driver costs. This paper presents an adaptive large neighborhood search for the PRP. Results of extensive computational experimentation confirm the efficiency of the algorithm.

Keywords: Vehicle routing; Fuel consumption; CO2 emissions; Freight transportation; Heuristic algorithm (search for similar items in EconPapers)
Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (160)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221712004997
Full text for ScienceDirect subscribers only

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:eee:ejores:v:223:y:2012:i:2:p:346-359

DOI: 10.1016/j.ejor.2012.06.044

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().