Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
480242 | European Journal of Operational Research | 2012 | 14 Pages |
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.
► A heuristic algorithm is described for the Pollution-Routing Problem (PRP). ► A speed optimization algorithm is offered to minimize fuel and driver costs. ► The algorithm is highly effective in solving PRP instances of up to 200 nodes.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Emrah Demir, Tolga Bektaş, Gilbert Laporte,