Optimal vehicle routing with lower and upper bounds on route durations
Optimal vehicle routing with lower and upper bounds on route durations
This article is concerned with the problem of finding optimal vehicle routes to minimize the overall travel time, with constraints on the minimum and maximum amount of time spent on each route. The problem extends previous work on the distance-constrained vehicle routing problem by introducing lower bounds on route durations to ensure that the resulting routes are balanced. The article also explicitly addresses the situation where a solution is artificially balanced as a result of inoptimal orders of visits. The article describes alternative ways in which the restrictions on route connectivity, duration, and artificial balancing can be formulated, and introduces an exact algorithm based on cutting planes and mixed-integer linear programming. To the best of our knowledge, this is the first exact algorithm proposed for such a problem that explicitly addresses artificially balanced routes. Computational results are presented for three versions of the exact algorithm using TSPLIB instances
166-179
Bektas, T.
0db10084-e51c-41e5-a3c6-417e0d08dac9
Lysgaard, J.
91d29fe9-19f0-4764-947b-d9d00c47c850
2 March 2015
Bektas, T.
0db10084-e51c-41e5-a3c6-417e0d08dac9
Lysgaard, J.
91d29fe9-19f0-4764-947b-d9d00c47c850
Bektas, T. and Lysgaard, J.
(2015)
Optimal vehicle routing with lower and upper bounds on route durations.
[in special issue: Recent Trends in Routing]
Networks, 65 (2), .
(doi:10.1002/net.21592).
Abstract
This article is concerned with the problem of finding optimal vehicle routes to minimize the overall travel time, with constraints on the minimum and maximum amount of time spent on each route. The problem extends previous work on the distance-constrained vehicle routing problem by introducing lower bounds on route durations to ensure that the resulting routes are balanced. The article also explicitly addresses the situation where a solution is artificially balanced as a result of inoptimal orders of visits. The article describes alternative ways in which the restrictions on route connectivity, duration, and artificial balancing can be formulated, and introduces an exact algorithm based on cutting planes and mixed-integer linear programming. To the best of our knowledge, this is the first exact algorithm proposed for such a problem that explicitly addresses artificially balanced routes. Computational results are presented for three versions of the exact algorithm using TSPLIB instances
This record has no associated files available for download.
More information
Accepted/In Press date: 2 March 2015
Published date: 2 March 2015
Organisations:
Centre of Excellence in Decision, Analytics & Risk Research
Identifiers
Local EPrints ID: 374931
URI: http://eprints.soton.ac.uk/id/eprint/374931
ISSN: 1097-0037
PURE UUID: 0ed621e2-f8a4-4d95-a3c6-511024a2059b
Catalogue record
Date deposited: 06 Mar 2015 11:38
Last modified: 14 Mar 2024 19:16
Export record
Altmetrics
Contributors
Author:
T. Bektas
Author:
J. Lysgaard
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