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

Emrah Demir, Tolga Bektaş, Gilbert Laporte

Research output: Contribution to journalArticlepeer-review

522 Citations (SciVal)


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 languageEnglish
Pages (from-to)346-359
Number of pages14
JournalEuropean Journal of Operational Research
Issue number2
Publication statusPublished - 1 Dec 2012


  • CO emissions
  • Freight transportation
  • Fuel consumption
  • Heuristic algorithm
  • Vehicle routing

ASJC Scopus subject areas

  • General Computer Science
  • Modelling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management


Dive into the research topics of 'An adaptive large neighborhood search heuristic for the Pollution-Routing Problem'. Together they form a unique fingerprint.

Cite this