A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph
A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph
We study a time-constrained heterogeneous vehicle routing problem on a multigraph where parallel arcs between pairs of vertices represent different travel options based on criteria such as time, cost, and distance. We formulate the problem as a mixed-integer linear programming model and develop a tabu search heuristic that efficiently addresses computational challenges due to parallel arcs. Numerical experiments show that the heuristic is highly effective and that freight operators can achieve advantages in cost and customer service by considering alternative paths, especially when route duration limits are restrictive and/or when vehicles of smaller capacity are dispatched to serve remote customers.
32-52
Lai, David S.w.
9e095afb-da7c-42e3-9e3e-a609bf12da57
Caliskan Demirag, Ozgun
412306d6-f148-4031-b73c-ce5849f35e38
Leung, Janny M.y.
f37e71c0-e2fc-4f2c-9dd5-bb897b1311da
Lai, David S.w.
9e095afb-da7c-42e3-9e3e-a609bf12da57
Caliskan Demirag, Ozgun
412306d6-f148-4031-b73c-ce5849f35e38
Leung, Janny M.y.
f37e71c0-e2fc-4f2c-9dd5-bb897b1311da
Lai, David S.w., Caliskan Demirag, Ozgun and Leung, Janny M.y.
(2016)
A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph.
Transportation Research Part E: Logistics and Transportation Review, 86, .
(doi:10.1016/j.tre.2015.12.001).
Abstract
We study a time-constrained heterogeneous vehicle routing problem on a multigraph where parallel arcs between pairs of vertices represent different travel options based on criteria such as time, cost, and distance. We formulate the problem as a mixed-integer linear programming model and develop a tabu search heuristic that efficiently addresses computational challenges due to parallel arcs. Numerical experiments show that the heuristic is highly effective and that freight operators can achieve advantages in cost and customer service by considering alternative paths, especially when route duration limits are restrictive and/or when vehicles of smaller capacity are dispatched to serve remote customers.
This record has no associated files available for download.
More information
Accepted/In Press date: 6 December 2015
e-pub ahead of print date: 11 January 2016
Identifiers
Local EPrints ID: 457405
URI: http://eprints.soton.ac.uk/id/eprint/457405
ISSN: 1366-5545
PURE UUID: 1c3f79e3-b8ad-4f0f-b008-946ff5333810
Catalogue record
Date deposited: 07 Jun 2022 16:37
Last modified: 17 Mar 2024 04:12
Export record
Altmetrics
Contributors
Author:
David S.w. Lai
Author:
Ozgun Caliskan Demirag
Author:
Janny M.y. Leung
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