4.5 Article

Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem

Journal

Publisher

WILEY
DOI: 10.1111/itor.13039

Keywords

Lagrangian relaxation; prize collecting traveling salesman problem; network optimization

Funding

  1. Brazilian funding agency CNPq [312549/2017-2]

Ask authors/readers for more resources

This study focuses on the prize collecting traveling salesman problem, proposing new formulations and comparing them with adaptations of strong formulations. By using a Lagrangian relaxation approach with heuristic schemes, the study successfully obtains optimal or near-optimal solutions.
The prize collecting traveling salesman problem (PCTSP) is a generalization of the traveling salesman problem (TSP) in which a tour starting at a root node must visit a subset of nodes to collect a prescribed amount of total prize minimizing the summation of travel costs and penalty costs associated with nonvisited nodes. We propose new formulations and compare them with adaptations to the PCTSP of strong formulations from the literature for the asymmetric TSP. One of the formulations proposed in this paper provided the tighter linear relaxation bounds on computational experiments based on benchmark instances for the asymmetric TSP. We then develop a Lagrangian relaxation approach embedding heuristic schemes to obtain both lower and upper bounds. The proposed heuristic has shown to be successful in obtaining optimal or near-optimal solutions with information from the Lagrangian subproblems. Our Lagrangian approach can thereupon provide small optimality gaps, being an efficient alternative to bound optimal values of large instances.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available