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

E. Demir; T. Bektas; G. Laporte

doi:10.1016/j.ejor.2012.06.044

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

E. Demir, T. Bektas, G. Laporte

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

474 Citations (Scopus)

6 Downloads (Pure)

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	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
Publication status	Published - 2012
Externally published	Yes

Access to Document

10.1016/j.ejor.2012.06.044

Cite this

@article{39b160eb210343c3ac91017783083531,

title = "An adaptive large neighborhood search based 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.",

author = "E. Demir and T. Bektas and G. Laporte",

year = "2012",

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

language = "English",

volume = "223",

pages = "346--359",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

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

AU - Demir, E.

AU - Bektas, T.

AU - Laporte, G.

PY - 2012

Y1 - 2012

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.

U2 - 10.1016/j.ejor.2012.06.044

DO - 10.1016/j.ejor.2012.06.044

M3 - Article

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 based heuristic for the Pollution-Routing Problem

Abstract

Access to Document

Fingerprint

Cite this