A metaheuristic for the time-dependent vehicle routing problem considering driving hours regulations – an application in city logistics
A metaheuristic for the time-dependent vehicle routing problem considering driving hours regulations – an application in city logistics
New retail trends show the increasing importance of providing cost efficient deliveries in cities, where congestion and compliance with driving hours regulations should be incorporated into routing software. This paper introduces a large neighbourhood search algorithm that substantially improves the benchmark solutions (in terms of the number of vehicles required, travel distance and duty time) for the vehicle routing problem variant considering time windows, time-dependent travel times and driving hours regulations (EC) 561/2006 that apply to vehicles over 3.5 tons in European cities. Additionally, instances for The Road Transport (Working Time) Regulation 2005 that applies to drivers in the United Kingdom are introduced. The proposed algorithm is also used in scenarios that represent home delivery conditions to evaluate the impacts of the length of time windows, customer density, congestion and regulations in terms of cost and environmental impact.
City logistics, Home delivery, Large neighbourhood search, Rules on drivers’ hours and working time, Time-dependent vehicle routing problem
429-446
Rincon Garcia, Nicolas
cc375b49-2591-4bb1-9bff-b9ded24fd934
Waterson, Ben
60a59616-54f7-4c31-920d-975583953286
Cherrett, Thomas
e5929951-e97c-4720-96a8-3e586f2d5f95
Salazar-Arrieta, Fernando
7e375eb3-fe62-4e0d-8ba2-d32f9879c639
July 2020
Rincon Garcia, Nicolas
cc375b49-2591-4bb1-9bff-b9ded24fd934
Waterson, Ben
60a59616-54f7-4c31-920d-975583953286
Cherrett, Thomas
e5929951-e97c-4720-96a8-3e586f2d5f95
Salazar-Arrieta, Fernando
7e375eb3-fe62-4e0d-8ba2-d32f9879c639
Rincon Garcia, Nicolas, Waterson, Ben, Cherrett, Thomas and Salazar-Arrieta, Fernando
(2020)
A metaheuristic for the time-dependent vehicle routing problem considering driving hours regulations – an application in city logistics.
Transportation Research Part A: Policy and Practice, 137, .
(doi:10.1016/j.tra.2018.10.033).
Abstract
New retail trends show the increasing importance of providing cost efficient deliveries in cities, where congestion and compliance with driving hours regulations should be incorporated into routing software. This paper introduces a large neighbourhood search algorithm that substantially improves the benchmark solutions (in terms of the number of vehicles required, travel distance and duty time) for the vehicle routing problem variant considering time windows, time-dependent travel times and driving hours regulations (EC) 561/2006 that apply to vehicles over 3.5 tons in European cities. Additionally, instances for The Road Transport (Working Time) Regulation 2005 that applies to drivers in the United Kingdom are introduced. The proposed algorithm is also used in scenarios that represent home delivery conditions to evaluate the impacts of the length of time windows, customer density, congestion and regulations in terms of cost and environmental impact.
Text
2018 Vehicle Routing (TResA)
- Accepted Manuscript
More information
Accepted/In Press date: 23 October 2018
e-pub ahead of print date: 13 November 2018
Published date: July 2020
Keywords:
City logistics, Home delivery, Large neighbourhood search, Rules on drivers’ hours and working time, Time-dependent vehicle routing problem
Identifiers
Local EPrints ID: 426352
URI: http://eprints.soton.ac.uk/id/eprint/426352
ISSN: 0965-8564
PURE UUID: 8ba007b1-c763-46db-aba4-902f9c74e200
Catalogue record
Date deposited: 23 Nov 2018 17:30
Last modified: 16 Mar 2024 07:18
Export record
Altmetrics
Contributors
Author:
Nicolas Rincon Garcia
Author:
Fernando Salazar-Arrieta
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics
