A metaheuristic for the time-dependent pollution-routing problem

Franceschetti, Anna, Demir, Emrah ORCID: https://orcid.org/0000-0002-4726-2556, Honhon, Dorothée, Van Woensel, Tom, Laporte, Gilbert and Stobbe, Mark 2017. A metaheuristic for the time-dependent pollution-routing problem. European Journal of Operational Research 259 (3) , pp. 972-991. 10.1016/j.ejor.2016.11.026

Preview

PDF - Accepted Post-Print Version Available under License Creative Commons Attribution Non-commercial No Derivatives. Download (631kB) | Preview

Abstract

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.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Business (Including Economics)
Subjects:	H Social Sciences > H Social Sciences (General)
Uncontrolled Keywords:	Routing; Freight transportation; Green vehicle routing; Greenhouse gases emissions; Metaheuristic algorithm; Departure time and speed optimization
Additional Information:	Released with a Creative Commons Attribution Non-Commercial No Derivatives License (CC BY-NC-ND)
Publisher:	Elsevier
ISSN:	0377-2217
Date of First Compliant Deposit:	8 September 2017
Date of Acceptance:	10 November 2016
Last Modified:	15 Nov 2024 19:45
URI:	https://orca.cardiff.ac.uk/id/eprint/96824

Citation Data

Cited 87 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item