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

July 2026publication date
Proposal available till 27-05-2025
4 total number of authors per manuscript0 $

The title of the journal is available only for the authors who have already paid for
Journal’s subject area:
Business and International Management;
Strategy and Management;
Management Science and Operations Research;
Management of Technology and Innovation;
Computer Science Applications;
Places in the authors’ list:
place 1place 2place 3place 4
FreeFreeFreeFree
2350 $1200 $1050 $900 $
Contract №4803.1 Contract №4803.2 Contract №4803.3 Contract №4803.4
1 place - free (for sale)
2 place - free (for sale)
3 place - free (for sale)
4 place - free (for sale)

Abstract:
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.
Keywords:
Lagrangian relaxation; network optimization; prize collecting traveling salesman problem

Contacts :
0