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

Emrah Demir; Tolga Bektaş; Gilbert Laporte

doi:10.1016/j.ejor.2012.06.044

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

Emrah Demir
, Tolga Bektaş
, Gilbert Laporte

Management Science & Engineering

University of Southampton
Logistics and Transportation HEC Montréal

Research output: Contribution to journal › Article › peer-review

672 Scopus citations

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.

Original language	British English
Pages (from-to)	346-359
Number of pages	14
Journal	European Journal of Operational Research
Volume	223
Issue number	2
DOIs	https://doi.org/10.1016/j.ejor.2012.06.044
State	Published - 1 Dec 2012

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 13 Climate Action

Keywords

CO emissions
Freight transportation
Fuel consumption
Heuristic algorithm
Vehicle routing

Access to Document

10.1016/j.ejor.2012.06.044

OpenUrl availability

Full text

Cite this

@article{2c9b15c439ea437093a2b1ed47ced520,

title = "An adaptive large neighborhood search heuristic for the Pollution-Routing Problem",

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 = "CO emissions, Freight transportation, Fuel consumption, Heuristic algorithm, Vehicle routing",

author = "Emrah Demir and Tolga Bekta{\c s} and Gilbert Laporte",

note = "Funding Information: The authors gratefully acknowledge funding provided by the University of Southampton School of Management and by the Canadian Natural Sciences and Engineering Research Council under grant 39682-10. Thanks are due to the referees for their valuable comments. ",

year = "2012",

month = dec,

day = "1",

doi = "10.1016/j.ejor.2012.06.044",

language = "British English",

volume = "223",

pages = "346--359",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier B.V.",

number = "2",

}

TY - JOUR

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

AU - Demir, Emrah

AU - Bektaş, Tolga

AU - Laporte, Gilbert

N1 - Funding Information: The authors gratefully acknowledge funding provided by the University of Southampton School of Management and by the Canadian Natural Sciences and Engineering Research Council under grant 39682-10. Thanks are due to the referees for their valuable comments.

PY - 2012/12/1

Y1 - 2012/12/1

N2 - 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.

AB - 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.

KW - CO emissions

KW - Freight transportation

KW - Fuel consumption

KW - Heuristic algorithm

KW - Vehicle routing

UR - https://www.scopus.com/pages/publications/84864633176

U2 - 10.1016/j.ejor.2012.06.044

DO - 10.1016/j.ejor.2012.06.044

M3 - Article

AN - SCOPUS:84864633176

SN - 0377-2217

VL - 223

SP - 346

EP - 359

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 2

ER -

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

Abstract

UN SDGs

Keywords

Access to Document

OpenUrl availability

Other files and links

Fingerprint

Cite this