The University of Southampton
University of Southampton Institutional Repository

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
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
1923-2926
141-160
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
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), 141-160. (doi:10.5267/j.ijiec.2016.6.002).

Record type: Article

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
Download (721kB)

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
ORCID for Ben Waterson: ORCID iD orcid.org/0000-0001-9817-7119

Catalogue record

Date deposited: 30 Jun 2016 09:28
Last modified: 07 Oct 2020 01:42

Export record

Altmetrics

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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×