Transformations of node-balanced routing problems
Transformations of node-balanced routing problems
This paper describes a polynomial transformation for a class of unit-demand vehicle routing problems, named node-balanced routing problems (BRP), where the number of nodes on each route is restricted to be in an interval such that the workload across the routes is balanced. The transformation is general in that it can be applied to single or multiple depot, homogeneous or heterogeneous fleet BRPs, and any combination thereof. At the heart of the procedure lies transforming the BRP into a generalized traveling salesman problem (GTSP), which can then be transformed into a traveling salesman problem (TSP). The transformed graph exhibits special properties which can be exploited to significantly reduce the number of arcs, and used to construct a formulation for the resulting TSP that amounts to no more than that of a constrained assignment problem. Computational results on a number of instances are presented
370-387
Martinez-Sykora, A.
2f9989e1-7860-4163-996c-b1e6f21d5bed
Bektas, T.
0db10084-e51c-41e5-a3c6-417e0d08dac9
10 August 2015
Martinez-Sykora, A.
2f9989e1-7860-4163-996c-b1e6f21d5bed
Bektas, T.
0db10084-e51c-41e5-a3c6-417e0d08dac9
Martinez-Sykora, A. and Bektas, T.
(2015)
Transformations of node-balanced routing problems.
Naval Research Logistics (NRL), 62 (5), .
(doi:10.1002/nav.21634).
Abstract
This paper describes a polynomial transformation for a class of unit-demand vehicle routing problems, named node-balanced routing problems (BRP), where the number of nodes on each route is restricted to be in an interval such that the workload across the routes is balanced. The transformation is general in that it can be applied to single or multiple depot, homogeneous or heterogeneous fleet BRPs, and any combination thereof. At the heart of the procedure lies transforming the BRP into a generalized traveling salesman problem (GTSP), which can then be transformed into a traveling salesman problem (TSP). The transformed graph exhibits special properties which can be exploited to significantly reduce the number of arcs, and used to construct a formulation for the resulting TSP that amounts to no more than that of a constrained assignment problem. Computational results on a number of instances are presented
Text
SB_Transf_v2.pdf
- Accepted Manuscript
More information
Accepted/In Press date: 7 June 2015
e-pub ahead of print date: 7 July 2015
Published date: 10 August 2015
Organisations:
Centre of Excellence in Decision, Analytics & Risk Research
Identifiers
Local EPrints ID: 377855
URI: http://eprints.soton.ac.uk/id/eprint/377855
ISSN: 0894-069X
PURE UUID: 570997a9-bc65-4dea-a41b-d96989942d06
Catalogue record
Date deposited: 22 Jun 2015 13:00
Last modified: 15 Mar 2024 03:40
Export record
Altmetrics
Contributors
Author:
T. Bektas
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