Prize Collecting Travelling Salesman Problem - Fast Heuristic Separations

The Prize Collecting Travelling Salesman Problem (PCTSP) is an important generalization of the famous Travelling Salesman Problem. It also arises as a sub problem in many variants of the Vehicle Routing Problem. In this paper, we provide efficient methods to solve the linear programming relaxation of the PCTSP. We provide efficient heuristics to obtain the Generalized Subtour Elimination Constraints (GSECs) for the PCTSP, and compare its performance with an optimal separation procedure. Furthermore, we show that a heuristic to separate the primitive comb inequalities for the TSP can be applied to separate the primitive comb inequalities introduced for the PCTSP. We evaluate the effectiveness of these inequalities in reducing the integrality gap for

[1]  Luís Gouveia,et al.  The Skill Vehicle Routing Problem , 2011, INOC.

[2]  Luiz Antonio Nogueira Lorena,et al.  Hybrid Metaheuristic for the Prize Collecting Travelling Salesman Problem , 2008, EvoCOP.

[3]  J. Monnot,et al.  The Traveling Salesman Problem and its Variations , 2014 .

[4]  M. Fischetti,et al.  AN ADDITIVE APPROACH FOR THE OPTIMAL SOLUTION OF THE PRIZE-COLLECTING TRAVELLING SALESMAN PROBLEM. VEHICLE ROUTING: METHODS AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 , 1988 .

[5]  Michel X. Goemans,et al.  The Steiner tree polytope and related polyhedra , 1994, Math. Program..

[6]  H. P. Williams.  THEORY OF LINEAR AND INTEGER PROGRAMMING (Wiley-Interscience Series in Discrete Mathematics and Optimization) , 1989 .

[7]  Egon Balas,et al.  The prize collecting traveling salesman problem , 1989, Networks.

[8]  Michel Gendreau,et al.  A branch‐and‐cut algorithm for the undirected prize collecting traveling salesman problem , 2009, Networks.

[9]  H. Crowder,et al.  Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality , 1980 .

[10]  Manfred W. Padberg,et al.  On the symmetric travelling salesman problem: A computational study , 1980 .

[11]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[12]  Egon Balas,et al.  The prize collecting traveling salesman problem: II. Polyhedral results , 1995, Networks.

[13]  Matteo Fischetti,et al.  A Branch-and-Cut Algorithm for the Symmetric Generalized Travelling Salesman Problem , 1995 .