Local search for the Steiner tree problem in the Euclidean plane:
Abstract: "Most heuristics for the Steiner tree problem in the Euclidean plane perform a series of iterative improvements using the minimum spanning tree as an initial solution. We may therefore characterize them as local search heuristics. In this paper, we first give a survey of existing heur...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
København
1997
|
| Schriftenreihe: | Datalogisk Institut <København>: DIKU-Rapport
1997,21 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Most heuristics for the Steiner tree problem in the Euclidean plane perform a series of iterative improvements using the minimum spanning tree as an initial solution. We may therefore characterize them as local search heuristics. In this paper, we first give a survey of existing heuristic approaches from a local search perspective, by setting up solution spaces and neighbourhood structures. Secondly, we present a new general local search approach which is based on a list of full Steiner trees constructed in a preprocessing phase. This list defines a solution space on which three neighbourhood structures are proposed and evaluated. Computational results show that this new approach is very competitive from a cost-benefit point of view. Furthermore, it has the advantage of being easy to apply to the Steiner tree problem in other metric spaces and to obstacle avoiding variants." |
| Beschreibung: | 29 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV012174199 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 980929s1997 |||| 00||| eng d | ||
| 035 | |a (OCoLC)39082102 | ||
| 035 | |a (DE-599)BVBBV012174199 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Zachariasen, Martin |e Verfasser |0 (DE-588)122973933 |4 aut | |
| 245 | 1 | 0 | |a Local search for the Steiner tree problem in the Euclidean plane |c Martin Zachariasen |
| 264 | 1 | |a København |c 1997 | |
| 300 | |a 29 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Datalogisk Institut <København>: DIKU-Rapport |v 1997,21 | |
| 520 | 3 | |a Abstract: "Most heuristics for the Steiner tree problem in the Euclidean plane perform a series of iterative improvements using the minimum spanning tree as an initial solution. We may therefore characterize them as local search heuristics. In this paper, we first give a survey of existing heuristic approaches from a local search perspective, by setting up solution spaces and neighbourhood structures. Secondly, we present a new general local search approach which is based on a list of full Steiner trees constructed in a preprocessing phase. This list defines a solution space on which three neighbourhood structures are proposed and evaluated. Computational results show that this new approach is very competitive from a cost-benefit point of view. Furthermore, it has the advantage of being easy to apply to the Steiner tree problem in other metric spaces and to obstacle avoiding variants." | |
| 650 | 4 | |a Heuristic programming | |
| 650 | 4 | |a Mathematical optimization | |
| 650 | 4 | |a Trees (Graph theory) | |
| 830 | 0 | |a Datalogisk Institut <København>: DIKU-Rapport |v 1997,21 |w (DE-604)BV010011493 |9 1997,21 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-008248567 | ||
Datensatz im Suchindex
| _version_ | 1804126788371087360 |
|---|---|
| any_adam_object | |
| author | Zachariasen, Martin |
| author_GND | (DE-588)122973933 |
| author_facet | Zachariasen, Martin |
| author_role | aut |
| author_sort | Zachariasen, Martin |
| author_variant | m z mz |
| building | Verbundindex |
| bvnumber | BV012174199 |
| ctrlnum | (OCoLC)39082102 (DE-599)BVBBV012174199 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01892nam a2200313 cb4500</leader><controlfield tag="001">BV012174199</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">980929s1997 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)39082102</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV012174199</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Zachariasen, Martin</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)122973933</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Local search for the Steiner tree problem in the Euclidean plane</subfield><subfield code="c">Martin Zachariasen</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">København</subfield><subfield code="c">1997</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">29 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Datalogisk Institut <København>: DIKU-Rapport</subfield><subfield code="v">1997,21</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Most heuristics for the Steiner tree problem in the Euclidean plane perform a series of iterative improvements using the minimum spanning tree as an initial solution. We may therefore characterize them as local search heuristics. In this paper, we first give a survey of existing heuristic approaches from a local search perspective, by setting up solution spaces and neighbourhood structures. Secondly, we present a new general local search approach which is based on a list of full Steiner trees constructed in a preprocessing phase. This list defines a solution space on which three neighbourhood structures are proposed and evaluated. Computational results show that this new approach is very competitive from a cost-benefit point of view. Furthermore, it has the advantage of being easy to apply to the Steiner tree problem in other metric spaces and to obstacle avoiding variants."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Heuristic programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Trees (Graph theory)</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Datalogisk Institut <København>: DIKU-Rapport</subfield><subfield code="v">1997,21</subfield><subfield code="w">(DE-604)BV010011493</subfield><subfield code="9">1997,21</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-008248567</subfield></datafield></record></collection> |
| id | DE-604.BV012174199 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:23:01Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-008248567 |
| oclc_num | 39082102 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 29 S. |
| publishDate | 1997 |
| publishDateSearch | 1997 |
| publishDateSort | 1997 |
| record_format | marc |
| series | Datalogisk Institut <København>: DIKU-Rapport |
| series2 | Datalogisk Institut <København>: DIKU-Rapport |
| spelling | Zachariasen, Martin Verfasser (DE-588)122973933 aut Local search for the Steiner tree problem in the Euclidean plane Martin Zachariasen København 1997 29 S. txt rdacontent n rdamedia nc rdacarrier Datalogisk Institut <København>: DIKU-Rapport 1997,21 Abstract: "Most heuristics for the Steiner tree problem in the Euclidean plane perform a series of iterative improvements using the minimum spanning tree as an initial solution. We may therefore characterize them as local search heuristics. In this paper, we first give a survey of existing heuristic approaches from a local search perspective, by setting up solution spaces and neighbourhood structures. Secondly, we present a new general local search approach which is based on a list of full Steiner trees constructed in a preprocessing phase. This list defines a solution space on which three neighbourhood structures are proposed and evaluated. Computational results show that this new approach is very competitive from a cost-benefit point of view. Furthermore, it has the advantage of being easy to apply to the Steiner tree problem in other metric spaces and to obstacle avoiding variants." Heuristic programming Mathematical optimization Trees (Graph theory) Datalogisk Institut <København>: DIKU-Rapport 1997,21 (DE-604)BV010011493 1997,21 |
| spellingShingle | Zachariasen, Martin Local search for the Steiner tree problem in the Euclidean plane Datalogisk Institut <København>: DIKU-Rapport Heuristic programming Mathematical optimization Trees (Graph theory) |
| title | Local search for the Steiner tree problem in the Euclidean plane |
| title_auth | Local search for the Steiner tree problem in the Euclidean plane |
| title_exact_search | Local search for the Steiner tree problem in the Euclidean plane |
| title_full | Local search for the Steiner tree problem in the Euclidean plane Martin Zachariasen |
| title_fullStr | Local search for the Steiner tree problem in the Euclidean plane Martin Zachariasen |
| title_full_unstemmed | Local search for the Steiner tree problem in the Euclidean plane Martin Zachariasen |
| title_short | Local search for the Steiner tree problem in the Euclidean plane |
| title_sort | local search for the steiner tree problem in the euclidean plane |
| topic | Heuristic programming Mathematical optimization Trees (Graph theory) |
| topic_facet | Heuristic programming Mathematical optimization Trees (Graph theory) |
| volume_link | (DE-604)BV010011493 |
| work_keys_str_mv | AT zachariasenmartin localsearchforthesteinertreeproblemintheeuclideanplane |