A branch-and-bound algorithm for the close-enough traveling salesman problem
A branch-and-bound algorithm for the close-enough traveling salesman problem
This paper addresses the close-enough traveling salesman problem. In this problem, rather than visiting the vertex (customer) itself, the salesman must visit a specific region containing such vertex. To solve this problem, we propose a simple yet effective exact algorithm, based on branch-and-bound and second order cone programming. The proposed algorithm was tested in 824 instances suggested in the literature. Optimal solutions are obtained for open problems with up to a thousand vertices. We consider instances both in two- and three-dimensional space
752-765
Pereira Coutinho, Walton
844cd0ea-6cef-45fd-98f6-906493797077
Do Nascimento, Roberto Q.
0213d998-935a-4af0-ad5e-34f7f4bf1321
Subramanian, Anand
12026cc6-35f0-4a66-8806-e992fbd26d1e
Pessoa, Artur A.
2c50dc95-4b5d-4e46-9df0-b619b0d10db3
5 October 2016
Pereira Coutinho, Walton
844cd0ea-6cef-45fd-98f6-906493797077
Do Nascimento, Roberto Q.
0213d998-935a-4af0-ad5e-34f7f4bf1321
Subramanian, Anand
12026cc6-35f0-4a66-8806-e992fbd26d1e
Pessoa, Artur A.
2c50dc95-4b5d-4e46-9df0-b619b0d10db3
Pereira Coutinho, Walton, Do Nascimento, Roberto Q., Subramanian, Anand and Pessoa, Artur A.
(2016)
A branch-and-bound algorithm for the close-enough traveling salesman problem.
INFORMS Journal on Computing, 28 (4), .
(doi:10.1287/ijoc.2016.0711).
Abstract
This paper addresses the close-enough traveling salesman problem. In this problem, rather than visiting the vertex (customer) itself, the salesman must visit a specific region containing such vertex. To solve this problem, we propose a simple yet effective exact algorithm, based on branch-and-bound and second order cone programming. The proposed algorithm was tested in 824 instances suggested in the literature. Optimal solutions are obtained for open problems with up to a thousand vertices. We consider instances both in two- and three-dimensional space
Other
ijoc.2016.0711
- Version of Record
Restricted to Repository staff only
Request a copy
More information
Accepted/In Press date: 17 March 2016
Published date: 5 October 2016
Organisations:
Operational Research
Identifiers
Local EPrints ID: 401362
URI: http://eprints.soton.ac.uk/id/eprint/401362
ISSN: 0899-1499
PURE UUID: 7e2e6df5-1bdd-41bf-97e2-a0413a3e4a48
Catalogue record
Date deposited: 13 Oct 2016 09:10
Last modified: 15 Mar 2024 02:45
Export record
Altmetrics
Contributors
Author:
Walton Pereira Coutinho
Author:
Roberto Q. Do Nascimento
Author:
Anand Subramanian
Author:
Artur A. Pessoa
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