We propose a metaheuristic for the Time-Dependent Pollution-Routing Problem, which consists of routing a number of vehicles to serve a set of customers and determining their speed on each route segment with the objective of minimizing the cost of driver’s wage and greenhouse gases emissions. The vehicles face traffic congestion which, at peak periods, significantly restricts vehicle speeds and leads to increased emissions. Our algorithm is based on an adaptive large neighborhood search heuristic and uses new removal and insertion operators which significantly improve the quality of the solution. A previously developed departure time and speed optimization procedure is used as a subroutine to optimize departure times and vehicle speeds. Results from extensive computational experiments demonstrate the effectiveness of our algorithm.
A metaheuristic for the time-dependent pollution-routing problem
2017-06-17
Franceschetti , A , Demir , E , Honhon , D , van Woensel , T , Laporte , G & Stobbe , M 2017 , ' A metaheuristic for the time-dependent pollution-routing problem ' , European Journal of Operational Research , vol. 259 , no. 3 , pp. 972-991 . https://doi.org/10.1016/j.ejor.2016.11.026
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
DDC: | 629 |
The time-dependent pollution-routing problem
Online Contents | 2013
|The time-dependent pollution-routing problem
Elsevier | 2013
|Hybrid metaheuristic solutions to inventory location routing problem
Elsevier | 2014
|Hybrid metaheuristic solutions to inventory location routing problem
Online Contents | 2014
|Solving Practical Vehicle Routing Problem with Time Windows Using Metaheuristic Algorithms
DOAJ | 2012
|