A Lagrangian heuristic for the Prize CollectingTravelling Salesman Problem
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...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Dell'Amico, M. [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
1998 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Kluwer Academic Publishers 1998 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Annals of operations research - Kluwer Academic Publishers, 1984, 81(1998) vom: Juni, Seite 289-306 |
|---|---|
| Übergeordnetes Werk: |
volume:81 ; year:1998 ; month:06 ; pages:289-306 |
| Links: |
|---|
| DOI / URN: |
10.1023/A:1018961208614 |
|---|
| Katalog-ID: |
OLC2111124834 |
|---|
| LEADER | 01000naa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2111124834 | ||
| 003 | DE-627 | ||
| 005 | 20230502202511.0 | ||
| 007 | tu | ||
| 008 | 230502s1998 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1023/A:1018961208614 |2 doi | |
| 035 | |a (DE-627)OLC2111124834 | ||
| 035 | |a (DE-He213)A:1018961208614-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |q VZ |
| 084 | |a 3,2 |2 ssgn | ||
| 100 | 1 | |a Dell'Amico, M. |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a A Lagrangian heuristic for the Prize CollectingTravelling Salesman Problem |
| 264 | 1 | |c 1998 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Kluwer Academic Publishers 1998 | ||
| 520 | |a 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. | ||
| 650 | 4 | |a Travelling Salesman Problem | |
| 650 | 4 | |a Travel Salesman Problem | |
| 650 | 4 | |a Balas | |
| 650 | 4 | |a Amico | |
| 650 | 4 | |a Orienteering Problem | |
| 700 | 1 | |a Maffioli, F. |4 aut | |
| 700 | 1 | |a Sciomachen, A. |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Annals of operations research |d Kluwer Academic Publishers, 1984 |g 81(1998) vom: Juni, Seite 289-306 |w (DE-627)12964370X |w (DE-600)252629-3 |w (DE-576)018141862 |x 0254-5330 |
| 773 | 1 | 8 | |g volume:81 |g year:1998 |g month:06 |g pages:289-306 |
| 856 | 4 | 1 | |u https://doi.org/10.1023/A:1018961208614 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-WIW | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a GBV_ILN_32 | ||
| 912 | |a GBV_ILN_4029 | ||
| 951 | |a AR | ||
| 952 | |d 81 |j 1998 |c 06 |h 289-306 | ||
| author_variant |
m d md f m fm a s as |
|---|---|
| matchkey_str |
article:02545330:1998----::lgagahuitcoterzcletntael |
| hierarchy_sort_str |
1998 |
| publishDate |
1998 |
| allfields |
10.1023/A:1018961208614 doi (DE-627)OLC2111124834 (DE-He213)A:1018961208614-p DE-627 ger DE-627 rakwb eng 004 VZ 3,2 ssgn Dell'Amico, M. verfasserin aut A Lagrangian heuristic for the Prize CollectingTravelling Salesman Problem 1998 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Kluwer Academic Publishers 1998 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. Travelling Salesman Problem Travel Salesman Problem Balas Amico Orienteering Problem Maffioli, F. aut Sciomachen, A. aut Enthalten in Annals of operations research Kluwer Academic Publishers, 1984 81(1998) vom: Juni, Seite 289-306 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:81 year:1998 month:06 pages:289-306 https://doi.org/10.1023/A:1018961208614 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT GBV_ILN_32 GBV_ILN_4029 AR 81 1998 06 289-306 |
| spelling |
10.1023/A:1018961208614 doi (DE-627)OLC2111124834 (DE-He213)A:1018961208614-p DE-627 ger DE-627 rakwb eng 004 VZ 3,2 ssgn Dell'Amico, M. verfasserin aut A Lagrangian heuristic for the Prize CollectingTravelling Salesman Problem 1998 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Kluwer Academic Publishers 1998 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. Travelling Salesman Problem Travel Salesman Problem Balas Amico Orienteering Problem Maffioli, F. aut Sciomachen, A. aut Enthalten in Annals of operations research Kluwer Academic Publishers, 1984 81(1998) vom: Juni, Seite 289-306 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:81 year:1998 month:06 pages:289-306 https://doi.org/10.1023/A:1018961208614 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT GBV_ILN_32 GBV_ILN_4029 AR 81 1998 06 289-306 |
| allfields_unstemmed |
10.1023/A:1018961208614 doi (DE-627)OLC2111124834 (DE-He213)A:1018961208614-p DE-627 ger DE-627 rakwb eng 004 VZ 3,2 ssgn Dell'Amico, M. verfasserin aut A Lagrangian heuristic for the Prize CollectingTravelling Salesman Problem 1998 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Kluwer Academic Publishers 1998 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. Travelling Salesman Problem Travel Salesman Problem Balas Amico Orienteering Problem Maffioli, F. aut Sciomachen, A. aut Enthalten in Annals of operations research Kluwer Academic Publishers, 1984 81(1998) vom: Juni, Seite 289-306 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:81 year:1998 month:06 pages:289-306 https://doi.org/10.1023/A:1018961208614 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT GBV_ILN_32 GBV_ILN_4029 AR 81 1998 06 289-306 |
| allfieldsGer |
10.1023/A:1018961208614 doi (DE-627)OLC2111124834 (DE-He213)A:1018961208614-p DE-627 ger DE-627 rakwb eng 004 VZ 3,2 ssgn Dell'Amico, M. verfasserin aut A Lagrangian heuristic for the Prize CollectingTravelling Salesman Problem 1998 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Kluwer Academic Publishers 1998 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. Travelling Salesman Problem Travel Salesman Problem Balas Amico Orienteering Problem Maffioli, F. aut Sciomachen, A. aut Enthalten in Annals of operations research Kluwer Academic Publishers, 1984 81(1998) vom: Juni, Seite 289-306 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:81 year:1998 month:06 pages:289-306 https://doi.org/10.1023/A:1018961208614 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT GBV_ILN_32 GBV_ILN_4029 AR 81 1998 06 289-306 |
| allfieldsSound |
10.1023/A:1018961208614 doi (DE-627)OLC2111124834 (DE-He213)A:1018961208614-p DE-627 ger DE-627 rakwb eng 004 VZ 3,2 ssgn Dell'Amico, M. verfasserin aut A Lagrangian heuristic for the Prize CollectingTravelling Salesman Problem 1998 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Kluwer Academic Publishers 1998 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. Travelling Salesman Problem Travel Salesman Problem Balas Amico Orienteering Problem Maffioli, F. aut Sciomachen, A. aut Enthalten in Annals of operations research Kluwer Academic Publishers, 1984 81(1998) vom: Juni, Seite 289-306 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:81 year:1998 month:06 pages:289-306 https://doi.org/10.1023/A:1018961208614 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT GBV_ILN_32 GBV_ILN_4029 AR 81 1998 06 289-306 |
| language |
English |
| source |
Enthalten in Annals of operations research 81(1998) vom: Juni, Seite 289-306 volume:81 year:1998 month:06 pages:289-306 |
| sourceStr |
Enthalten in Annals of operations research 81(1998) vom: Juni, Seite 289-306 volume:81 year:1998 month:06 pages:289-306 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Travelling Salesman Problem Travel Salesman Problem Balas Amico Orienteering Problem |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Annals of operations research |
| authorswithroles_txt_mv |
Dell'Amico, M. @@aut@@ Maffioli, F. @@aut@@ Sciomachen, A. @@aut@@ |
| publishDateDaySort_date |
1998-06-01T00:00:00Z |
| hierarchy_top_id |
12964370X |
| dewey-sort |
14 |
| id |
OLC2111124834 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">OLC2111124834</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502202511.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">230502s1998 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1023/A:1018961208614</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2111124834</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)A:1018961208614-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">3,2</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Dell'Amico, M.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A Lagrangian heuristic for the Prize CollectingTravelling Salesman Problem</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1998</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Kluwer Academic Publishers 1998</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Travelling Salesman Problem</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Travel Salesman Problem</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Balas</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Amico</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Orienteering Problem</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Maffioli, F.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sciomachen, A.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Annals of operations research</subfield><subfield code="d">Kluwer Academic Publishers, 1984</subfield><subfield code="g">81(1998) vom: Juni, Seite 289-306</subfield><subfield code="w">(DE-627)12964370X</subfield><subfield code="w">(DE-600)252629-3</subfield><subfield code="w">(DE-576)018141862</subfield><subfield code="x">0254-5330</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:81</subfield><subfield code="g">year:1998</subfield><subfield code="g">month:06</subfield><subfield code="g">pages:289-306</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1023/A:1018961208614</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4029</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">81</subfield><subfield code="j">1998</subfield><subfield code="c">06</subfield><subfield code="h">289-306</subfield></datafield></record></collection>
|
| author |
Dell'Amico, M. |
| spellingShingle |
Dell'Amico, M. ddc 004 ssgn 3,2 misc Travelling Salesman Problem misc Travel Salesman Problem misc Balas misc Amico misc Orienteering Problem A Lagrangian heuristic for the Prize CollectingTravelling Salesman Problem |
| authorStr |
Dell'Amico, M. |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)12964370X |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0254-5330 |
| topic_title |
004 VZ 3,2 ssgn A Lagrangian heuristic for the Prize CollectingTravelling Salesman Problem Travelling Salesman Problem Travel Salesman Problem Balas Amico Orienteering Problem |
| topic |
ddc 004 ssgn 3,2 misc Travelling Salesman Problem misc Travel Salesman Problem misc Balas misc Amico misc Orienteering Problem |
| topic_unstemmed |
ddc 004 ssgn 3,2 misc Travelling Salesman Problem misc Travel Salesman Problem misc Balas misc Amico misc Orienteering Problem |
| topic_browse |
ddc 004 ssgn 3,2 misc Travelling Salesman Problem misc Travel Salesman Problem misc Balas misc Amico misc Orienteering Problem |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Annals of operations research |
| hierarchy_parent_id |
12964370X |
| dewey-tens |
000 - Computer science, knowledge & systems |
| hierarchy_top_title |
Annals of operations research |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 |
| title |
A Lagrangian heuristic for the Prize CollectingTravelling Salesman Problem |
| ctrlnum |
(DE-627)OLC2111124834 (DE-He213)A:1018961208614-p |
| title_full |
A Lagrangian heuristic for the Prize CollectingTravelling Salesman Problem |
| author_sort |
Dell'Amico, M. |
| journal |
Annals of operations research |
| journalStr |
Annals of operations research |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
1998 |
| contenttype_str_mv |
txt |
| container_start_page |
289 |
| author_browse |
Dell'Amico, M. Maffioli, F. Sciomachen, A. |
| container_volume |
81 |
| class |
004 VZ 3,2 ssgn |
| format_se |
Aufsätze |
| author-letter |
Dell'Amico, M. |
| doi_str_mv |
10.1023/A:1018961208614 |
| dewey-full |
004 |
| title_sort |
a lagrangian heuristic for the prize collectingtravelling salesman problem |
| title_auth |
A Lagrangian heuristic for the Prize CollectingTravelling Salesman Problem |
| abstract |
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. © Kluwer Academic Publishers 1998 |
| abstractGer |
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. © Kluwer Academic Publishers 1998 |
| abstract_unstemmed |
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. © Kluwer Academic Publishers 1998 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT GBV_ILN_32 GBV_ILN_4029 |
| title_short |
A Lagrangian heuristic for the Prize CollectingTravelling Salesman Problem |
| url |
https://doi.org/10.1023/A:1018961208614 |
| remote_bool |
false |
| author2 |
Maffioli, F. Sciomachen, A. |
| author2Str |
Maffioli, F. Sciomachen, A. |
| ppnlink |
12964370X |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1023/A:1018961208614 |
| up_date |
2024-07-04T08:47:20.504Z |
| _version_ |
1803637584567468032 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">OLC2111124834</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502202511.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">230502s1998 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1023/A:1018961208614</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2111124834</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)A:1018961208614-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">3,2</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Dell'Amico, M.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A Lagrangian heuristic for the Prize CollectingTravelling Salesman Problem</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1998</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Kluwer Academic Publishers 1998</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Travelling Salesman Problem</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Travel Salesman Problem</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Balas</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Amico</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Orienteering Problem</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Maffioli, F.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sciomachen, A.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Annals of operations research</subfield><subfield code="d">Kluwer Academic Publishers, 1984</subfield><subfield code="g">81(1998) vom: Juni, Seite 289-306</subfield><subfield code="w">(DE-627)12964370X</subfield><subfield code="w">(DE-600)252629-3</subfield><subfield code="w">(DE-576)018141862</subfield><subfield code="x">0254-5330</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:81</subfield><subfield code="g">year:1998</subfield><subfield code="g">month:06</subfield><subfield code="g">pages:289-306</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1023/A:1018961208614</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4029</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">81</subfield><subfield code="j">1998</subfield><subfield code="c">06</subfield><subfield code="h">289-306</subfield></datafield></record></collection>
|
| score |
7.399955 |