A hybrid metaheuristic for the time-dependent vehicle routing problem with hard time windows
A hybrid metaheuristic for the time-dependent vehicle routing problem with hard time windows
This article paper presents a hybrid metaheuristic algorithm to solve the time-dependent vehicle routing problem with hard time windows. Time-dependent travel times are influenced by different congestion levels experienced throughout the day. Vehicle scheduling without consideration of congestion might lead to underestimation of travel times and consequently missed deliveries. The algorithm presented in this paper makes use of Large Neighbourhood Search approaches and Variable Neighbourhood Search techniques to guide the search. A first stage is specifically designed to reduce the number of vehicles required in a search space by the reduction of penalties generated by time-window violations with Large Neighbourhood Search procedures. A second stage minimises the travel distance and travel time in an ‘always feasible’
search space. Comparison of results with available test instances shows that the proposed algorithm is capable of obtaining a reduction in the number of vehicles (4.15%), travel distance (10.88%) and travel time (12.00%) compared to previous implementations in reasonable time
vehicle routing problem, time-dependent travel time, hybrid metaheuristic algorithm
141-160
Rincon Garcia, Nicolas
cc375b49-2591-4bb1-9bff-b9ded24fd934
Waterson, Ben
60a59616-54f7-4c31-920d-975583953286
Cherrett, Thomas
e5929951-e97c-4720-96a8-3e586f2d5f95
January 2017
Rincon Garcia, Nicolas
cc375b49-2591-4bb1-9bff-b9ded24fd934
Waterson, Ben
60a59616-54f7-4c31-920d-975583953286
Cherrett, Thomas
e5929951-e97c-4720-96a8-3e586f2d5f95
Rincon Garcia, Nicolas, Waterson, Ben and Cherrett, Thomas
(2017)
A hybrid metaheuristic for the time-dependent vehicle routing problem with hard time windows.
International Journal of Industrial Engineering Computations, 8 (1), .
(doi:10.5267/j.ijiec.2016.6.002).
Abstract
This article paper presents a hybrid metaheuristic algorithm to solve the time-dependent vehicle routing problem with hard time windows. Time-dependent travel times are influenced by different congestion levels experienced throughout the day. Vehicle scheduling without consideration of congestion might lead to underestimation of travel times and consequently missed deliveries. The algorithm presented in this paper makes use of Large Neighbourhood Search approaches and Variable Neighbourhood Search techniques to guide the search. A first stage is specifically designed to reduce the number of vehicles required in a search space by the reduction of penalties generated by time-window violations with Large Neighbourhood Search procedures. A second stage minimises the travel distance and travel time in an ‘always feasible’
search space. Comparison of results with available test instances shows that the proposed algorithm is capable of obtaining a reduction in the number of vehicles (4.15%), travel distance (10.88%) and travel time (12.00%) compared to previous implementations in reasonable time
Text
IJIEC_2016_18.pdf
- Accepted Manuscript
More information
Accepted/In Press date: 16 June 2016
e-pub ahead of print date: 16 June 2016
Published date: January 2017
Keywords:
vehicle routing problem, time-dependent travel time, hybrid metaheuristic algorithm
Organisations:
Civil Maritime & Env. Eng & Sci Unit, Transportation Group
Identifiers
Local EPrints ID: 397325
URI: http://eprints.soton.ac.uk/id/eprint/397325
ISSN: 1923-2926
PURE UUID: 63c30833-991d-4783-bf1e-4d4735081b3f
Catalogue record
Date deposited: 30 Jun 2016 09:28
Last modified: 15 Mar 2024 02:58
Export record
Altmetrics
Contributors
Author:
Nicolas Rincon Garcia
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
