Integer linear programming formulations of multiple salesman problems and its variations
Integer linear programming formulations of multiple salesman problems and its variations
In this paper, we extend the classical multiple traveling salesman problem (mTSP) by imposing a minimal number of nodes that a traveler must visit as a side condition. We consider single and multidepot cases and propose integer linear programming formulations for both, with new bounding and subtour elimination constraints. We show that several variations of the multiple salesman problem can be modeled in a similar manner. Computational analysis shows that the solution of the multidepot mTSP with the proposed formulation is significantly superior to previous approaches
integer programming, multidepot multisalesmen problem, subtour elimination constraints
1449-1458
Kara, I.
835e224c-e0bf-473c-9184-6988af525bc0
Bektas, T.
0db10084-e51c-41e5-a3c6-417e0d08dac9
November 2006
Kara, I.
835e224c-e0bf-473c-9184-6988af525bc0
Bektas, T.
0db10084-e51c-41e5-a3c6-417e0d08dac9
Kara, I. and Bektas, T.
(2006)
Integer linear programming formulations of multiple salesman problems and its variations.
European Journal of Operational Research, 174 (3), .
(doi:10.1016/j.ejor.2005.03.008).
Abstract
In this paper, we extend the classical multiple traveling salesman problem (mTSP) by imposing a minimal number of nodes that a traveler must visit as a side condition. We consider single and multidepot cases and propose integer linear programming formulations for both, with new bounding and subtour elimination constraints. We show that several variations of the multiple salesman problem can be modeled in a similar manner. Computational analysis shows that the solution of the multidepot mTSP with the proposed formulation is significantly superior to previous approaches
This record has no associated files available for download.
More information
Published date: November 2006
Keywords:
integer programming, multidepot multisalesmen problem, subtour elimination constraints
Identifiers
Local EPrints ID: 47686
URI: http://eprints.soton.ac.uk/id/eprint/47686
ISSN: 0377-2217
PURE UUID: f0998bce-3ddc-4c53-81f3-ddf8890c2e92
Catalogue record
Date deposited: 08 Aug 2007
Last modified: 15 Mar 2024 09:35
Export record
Altmetrics
Contributors
Author:
I. Kara
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