Exact Solutions for the Carrier-Vehicle Traveling Salesman Problem

Carrier–vehicle systems generally consist of a slow carrier (e.g., a ship) with a long operational range and a faster vehicle (e.g., an aircraft) with a limited operational range. The carrier has the role of transporting the faster vehicle and of deploying, recovering, and servicing it. The goal of the carrier–vehicle traveling salesman problem (CVTSP) is to permit the faster vehicle to visit a given collection of targets in the shortest time while using the carrier as a base for possible multiple trips. As a consequence, the carrier and vehicle should be synchronized. The visiting sequence of the targets is not given a priori. We present a mixed-integer, second-order conic programming (MISOCP) formulation for the CVTSP. Computational results are shown for the resolution of the model with commercial solvers. The MISOCP structure and the relationship to the traveling salesman problem are exploited for developing a ranking-based solution algorithm that outperforms the commercial solvers.

[1]  Emanuele Garone,et al.  A travelling salesman problem for a class of heterogeneous multi-vehicle systems , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[2]  Louis-Martin Rousseau,et al.  Improved filtering for weighted circuit constraints , 2012, Constraints.

[3]  Miroslav Fikar,et al.  Mixed-integer SOCP formulation of the path planning problem for heterogeneous multi-vehicle systems , 2014, 2014 European Control Conference (ECC).

[4]  E. Lawler.  A PROCEDURE FOR COMPUTING THE K BEST SOLUTIONS TO DISCRETE OPTIMIZATION PROBLEMS AND ITS APPLICATION TO THE SHORTEST PATH PROBLEM , 1972 .

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

[6]  Emanuele Garone,et al.  Generalized Traveling Salesman Problem for Carrier-Vehicle Systems , 2014 .

[7]  Richard M. Murray,et al.  Recent Research in Cooperative Control of Multivehicle Systems , 2007 .

[8]  Gregory S. Parnell,et al.  An Air Mission Planning Algorithm Using Decision Analysis and Mixed Integer Programming , 1997, Oper. Res..

[9]  John N. Hooker,et al.  A Filter for the Circuit Constraint , 2006, CP.

[10]  Christodoulos A. Floudas,et al.  ANTIGONE: Algorithms for coNTinuous / Integer Global Optimization of Nonlinear Equations , 2014, Journal of Global Optimization.

[11]  Knud D. Andersen,et al.  The Mosek Interior Point Optimizer for Linear Programming: An Implementation of the Homogeneous Algorithm , 2000 .

[12]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[13]  Gerhard J. Woeginger,et al.  On the nearest neighbor rule for the traveling salesman problem , 2004, Oper. Res. Lett..

[14]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[15]  Kenji Shimada,et al.  The travelling salesman problem with neighbourhoods: MINLP solution , 2013, Optim. Methods Softw..

[16]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[17]  Tobias Achterberg,et al.  SCIP: solving constraint integer programs , 2009, Math. Program. Comput..

[18]  Emanuele Garone,et al.  Traveling Salesman Problem for a Class of Carrier-Vehicle Systems , 2011 .

[19]  Scott A. Bortoff,et al.  Path planning for UAVs , 2000, Proceedings of the 2000 American Control Conference. ACC (IEEE Cat. No.00CH36334).