What is it about?
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.
Featured Image
Why is it important?
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.
Perspectives
Writing this article was a great pleasure as it has co-authors with whom I have had long standing collaborations.
Mr. Walton WPC Pereira Coutinho
University of Southampton
Read the Original
This page is a summary of: A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem, INFORMS Journal on Computing, November 2016, INFORMS,
DOI: 10.1287/ijoc.2016.0711.
You can read the full text:
Contributors
The following have contributed to this page
