A metaheuristic for the time-dependent pollution-routing problem

Anna Franceschetti, Emrah Demir, Dorothée Honhon, Tom van Woensel, Gilbert Laporte, Mark Stobbe

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

66 Citaten (Scopus)
2 Downloads (Pure)


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.
Originele taal-2Engels
Pagina's (van-tot)972-991
Aantal pagina's20
TijdschriftEuropean Journal of Operational Research
Nummer van het tijdschrift3
StatusGepubliceerd - 17 jun 2017

Vingerafdruk Duik in de onderzoeksthema's van 'A metaheuristic for the time-dependent pollution-routing problem'. Samen vormen ze een unieke vingerafdruk.

Citeer dit