The travelling salesman problem with neighbourhoods: MINLP solution

The travelling salesman problem (TSP) with neighbourhoods extends the TSP to the case where each vertex of the tour is allowed to move in a given region. This NP-hard optimization problem has recently received increasing attention in several technical fields such as robotics, unmanned aerial vehicles, or utility management. In this paper, the problem is formulated as a non-convex mixed-integer nonlinear programme (MINLP) having the property that fixing all the integer variables to any integer values yield a convex nonlinear programme. This property is used to modify the global MINLP optimizer Couenne, improving by orders of magnitude its performance and allowing the exact solution of instances large enough to be useful in applications. Computational results are presented where neighbourhoods are either polyhedra or ellipsoids in ℝ2 or ℝ3 and with the Euclidean norm as distance metric.

[1]  Abraham P. Punnen,et al.  The traveling salesman problem and its variations , 2007 .

[2]  Nikolaos V. Sahinidis,et al.  BARON: A general purpose global optimization software package , 1996, J. Glob. Optim..

[3]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[4]  H. P. Williams,et al.  A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem , 2007 .

[5]  Ning Yang,et al.  Heuristic Approaches for a TSP Variant: The Automatic Meter Reading Shortest Tour Problem , 2007 .

[6]  Martin Grötschel,et al.  Solution of large-scale symmetric travelling salesman problems , 1991, Math. Program..

[7]  Khaled M. Elbassioni,et al.  Approximation Algorithms for the Euclidean Traveling Salesman Problem with Discrete and Continuous Neighborhoods , 2009, Int. J. Comput. Geom. Appl..

[8]  Ramesh Krishnamurti,et al.  View Planning Problem with Combined View and Traveling Cost , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[9]  Esther M. Arkin,et al.  Approximation Algorithms for the Geometric Covering Salesman Problem , 1994, Discret. Appl. Math..

[10]  Lorenz T. Biegler,et al.  On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming , 2006, Math. Program..

[11]  Brian W. Kernighan,et al.  AMPL: A Modeling Language for Mathematical Programming , 1993 .

[12]  Leo Liberti,et al.  Branching and bounds tighteningtechniques for non-convex MINLP , 2009, Optim. Methods Softw..

[13]  Gérard Cornuéjols,et al.  An algorithmic framework for convex mixed integer nonlinear programs , 2008, Discret. Optim..

[14]  Luis Enrique Sucar,et al.  View planning for 3D object reconstruction , 2009, 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[15]  Giovanni Rinaldi,et al.  A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

[16]  R. Bixby,et al.  On the Solution of Traveling Salesman Problems , 1998 .

[17]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[18]  Jun Ota,et al.  Coordinated motion control of a robot arm and a positioning table with arrangement of multiple goals , 2008, 2008 IEEE International Conference on Robotics and Automation.

[19]  William Mennell.  Heuristics for Solving Three Routing Problems: Close-Enough Traveling Salesman Problem, Close-Enough Vehicle Routing Problem, Sequence-Dependent Team Orienteering Problem , 2009 .