An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem

  title={An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem},
  author={Behnam Behdani and Jonathan Cole Smith},
  journal={INFORMS Journal on Computing},
We address a variant of the Traveling Salesman Problem known as the Close-Enough Traveling Salesman Problem (CETSP), where the traveler visits a node if it enters a compact neighborhood set of that node. We formulate a mixed-integer programming model based on a discretization scheme for the problem. Both lower and upper bounds on the optimal CETSP tour length can be derived from the solution of this model, and the quality of the bounds obtained depends on the fidelity of the discretization… CONTINUE READING


Publications referenced by this paper.
Showing 1-10 of 21 references

The Covering Tour Problem

Operations Research • 1997
View 9 Excerpts
Highly Influenced

Minimizing transmission energy in sensor networks via trajectory control

8th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks • 2010
View 1 Excerpt

Advances in meter reading: Heuristic solution of the close enough traveling salesman problem over a street network

R. Shuttleworth, B. L. Golden, S. Smith, E. Wasil.
B. L. Golden, S. Raghavan, E. A. Wasil, eds., The Vehicle Routing Problem: Latest Advances and New Challenges , vol. 43. Springer, 487–501. • 2008
View 1 Excerpt

On the Optimal Robot Routing Problem in Wireless Sensor Networks

IEEE Transactions on Knowledge and Data Engineering • 2007
View 1 Excerpt

The Traveling Salesman Problem: A Computational Study

D. L. Applegate, R. E. Bixby, V. Chvatal, W. J. Cook.
Princeton University Press, Princeton, NJ. • 2006
View 2 Excerpts

The close enough traveling salesman problem: A discussion of several heuristics

D. J. Gulczynski, J. W. Heath, C. C. Price.
Perspectives in Operations Research 36 271– 283. • 2006
View 1 Excerpt

Similar Papers

Loading similar papers…