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 | |
| Publication status | Published - 1 Dec 2012 |
Funding
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.
Keywords
- 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