|
|||||
|
|
An adaptive large neighborhood search heuristic for the Pollution-Routing Problem |
|
| Authors: | Emrah Demir Tolga Bekta? Gilbert Laporte |
| Institution: | 1. School of Management and Centre for Operational Research, Management Science and Information Systems (CORMSIS), University of Southampton, Southampton, Highfield SO17 1BJ, United Kingdom;2. Canada Research Chair in Distribution Management and Interuniversity Research Centre on Enterprise Networks, Logistics, and Transportation (CIRRELT), HEC Montréal 3000, Chemin de la Côte-Sainte-Catherine, Montréal, Canada H3T 2A7 |
| 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. |
| Keywords: | Vehicle routing Fuel consumption CO2 emissions Freight transportation Heuristic algorithm |
| 本文献已被 ScienceDirect 等数据库收录！ | |