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

@article{Behdani2014AnIA,
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},
year={2014},
volume={26},
pages={415-432}
}

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