An exact approach for a variant of the pollution-routing problem

S. Dabia, E. Demir, T. van Woensel

Research output: Contribution to journalArticleAcademicpeer-review

28 Citations (Scopus)
2 Downloads (Pure)

Abstract

The pollution-routing problem (PRP) is a recently introduced green vehicle routing problem in the field of green logistics. It concerns routing a number of vehicles to serve a set of geographically dispersed customers within their time windows, jointly with determining their speed on each arc so as to minimize fuel and driving costs. Because of its complexity, all known solution methods are based on (meta-)heuristics. This paper presents an exact solution based on a branch-and-price algorithm for a variant of the PRP. The master problem is a set-partitioning problem, and the pricing problem is a speed- and start-time elementary shortest path problem with resource constraints, in which the speed and start time at the depot needs to be decided on for each individual route. The master problem is solved by means of column generation, and a tailored labeling algorithm is used to solve the pricing problem. New dominance criteria are developed to discard unpromising labels by exploiting the structure of the ready time and the fuel consumption functions. Extensive computational experiments show the value of the proposed algorithm.

Keywords: green vehicle routing; fuel consumption; vehicle routing problem; branch and price
Original languageEnglish
Pages (from-to)607 - 628
Number of pages22
JournalTransportation Science
Volume51
Issue number2
DOIs
Publication statusPublished - 1 May 2017

Keywords

  • Branch and price
  • Fuel consumption
  • Green vehicle routing
  • Vehicle routing problem

Fingerprint Dive into the research topics of 'An exact approach for a variant of the pollution-routing problem'. Together they form a unique fingerprint.

  • Cite this