Prize Collecting Travelling Salesman Problem - Fast Heuristic Separations

Kamyar Khodamoradi, Ramesh Krishnamurti
2016 Proceedings of 5th the International Conference on Operations Research and Enterprise Systems  
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.
more » ... ore, 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 the PCTSP.
doi:10.5220/0005758103800387 dblp:conf/icores/KhodamoradiK16 fatcat:pycaug6yazgu3dl6rjwa77kjma