A Lagrangian heuristic for the Prize CollectingTravelling Salesman Problem

M. Dell'Amico, F. Maffioli and A. Sciomachen

Annals of Operations Research, 1998, vol. 81, issue 0, 289-306

Abstract: In this paper, we consider the Prize Collecting Travelling Salesman Problem (PCTSP),which is a variant of the Travelling Salesman Problem (TSP), where a tour visiting eachnode at most once in a given graph has to be computed such that a prize is associated witheach node and a penalty has to be paid for every unvisited node: moreover, a knapsackconstraint guarantees that a sufficiently large prize is collected. We develop a Lagrangianheuristic and obtain an upper bound in the form of a feasible solution starting from a lowerbound to the problem recently proposed in the literature. We evaluate these bounds utilizingboth randomly generated instances and real ones with very satisfactory results. Copyright Kluwer Academic Publishers 1998

Date: 1998
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018961208614 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:81:y:1998:i:0:p:289-306:10.1023/a:1018961208614

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018961208614

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().