The Traveling Salesman Problem with Neighborhoods: MINLP solution.pdf.pdf' (455.4 kB)
Download file

The Traveling Salesman Problem with Neighborhoods: MINLP solution

Download (455.4 kB)
journal contribution
posted on 01.08.2008, 00:00 by Iacopo Gentilini, Francois MargotFrancois Margot, Kenji ShimadaKenji Shimada

The traveling salesman problem with neighborhoods extends the traveling salesman problem 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 Program (MINLP) having the property that fixing all the integer variables to any integer values yields a convex nonlinear program. 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 neighborhoods are either polyhedra or ellipsoids in R2 or R3 and with the Euclidean norm as distance metric.

History

Publisher Statement

© The Author 2009. Published by Oxford University Press on behalf of Ifo Institute for Economic Research, Munich. All rights reserved. For permissions, please email: journals.permissions@oxfordjournals.org

Date

01/08/2008