Local search for the Steiner tree problem in the Euclidean plane
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...
Gespeichert in:
| Veröffentlicht in: | European journal of operational research 1999-12, Vol.119 (2), p.282-300 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 300 |
|---|---|
| container_issue | 2 |
| container_start_page | 282 |
| container_title | European journal of operational research |
| container_volume | 119 |
| creator | Zachariasen, Martin |
| description | 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. |
| doi_str_mv | 10.1016/S0377-2217(99)00131-9 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_204146663</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0377221799001319</els_id><sourcerecordid>50958521</sourcerecordid><originalsourceid>FETCH-LOGICAL-c402t-1d540637882169c52b5ea1c2756db6aba27f99cd0d40764c84bc40cb5dcb8cc53</originalsourceid><addsrcrecordid>eNqFUF1LwzAUDaLgnP4EofikD9UkbdLmSWXMDxz4MH0O6e0ty-jamnSD_XvTVfZq4OYeuOecezmEXDN6zyiTD0uaZFnMOctulbqjlCUsVidkwvKMxzKX9JRMjpRzcuH9mgaWYGJCnhYtmDryaBysoqp1Ub_CaNmjbTBghxh1ri1q3ES2OczmW6htiaaJuto0eEnOKlN7vPrrU_L9Mv-avcWLz9f32fMihpTyPmalSKlMsjznTCoQvBBoGPBMyLKQpjA8q5SCkpYpzWQKeVoEIRSihCIHEMmU3Iy-4ZyfLfper9uta8JKzWnKUillEkhiJIFrvXdY6c7ZjXF7zagestKHrPQQhFZKH7LSKug-Rp3DDuEowvDWrUOvdzoxjKnw7wek1ABtKB6qG3oeEKV61W-C2-PohiGPnUWnPVhsAEvrEHpdtvafe34BFtOIxw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>204146663</pqid></control><display><type>article</type><title>Local search for the Steiner tree problem in the Euclidean plane</title><source>RePEc</source><source>Elsevier ScienceDirect Journals</source><creator>Zachariasen, Martin</creator><creatorcontrib>Zachariasen, Martin</creatorcontrib><description>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.</description><identifier>ISSN: 0377-2217</identifier><identifier>EISSN: 1872-6860</identifier><identifier>DOI: 10.1016/S0377-2217(99)00131-9</identifier><identifier>CODEN: EJORDT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Algorithms ; Heuristic ; Heuristics ; Local search ; Operations research ; Steiner trees ; Studies ; Survey</subject><ispartof>European journal of operational research, 1999-12, Vol.119 (2), p.282-300</ispartof><rights>1999 Elsevier Science B.V.</rights><rights>Copyright Elsevier Sequoia S.A. Dec 1, 1999</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c402t-1d540637882169c52b5ea1c2756db6aba27f99cd0d40764c84bc40cb5dcb8cc53</citedby><cites>FETCH-LOGICAL-c402t-1d540637882169c52b5ea1c2756db6aba27f99cd0d40764c84bc40cb5dcb8cc53</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/S0377-2217(99)00131-9$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,777,781,3537,3994,27905,27906,45976</link.rule.ids><backlink>$$Uhttp://econpapers.repec.org/article/eeeejores/v_3a119_3ay_3a1999_3ai_3a2_3ap_3a282-300.htm$$DView record in RePEc$$Hfree_for_read</backlink></links><search><creatorcontrib>Zachariasen, Martin</creatorcontrib><title>Local search for the Steiner tree problem in the Euclidean plane</title><title>European journal of operational research</title><description>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.</description><subject>Algorithms</subject><subject>Heuristic</subject><subject>Heuristics</subject><subject>Local search</subject><subject>Operations research</subject><subject>Steiner trees</subject><subject>Studies</subject><subject>Survey</subject><issn>0377-2217</issn><issn>1872-6860</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1999</creationdate><recordtype>article</recordtype><sourceid>X2L</sourceid><recordid>eNqFUF1LwzAUDaLgnP4EofikD9UkbdLmSWXMDxz4MH0O6e0ty-jamnSD_XvTVfZq4OYeuOecezmEXDN6zyiTD0uaZFnMOctulbqjlCUsVidkwvKMxzKX9JRMjpRzcuH9mgaWYGJCnhYtmDryaBysoqp1Ub_CaNmjbTBghxh1ri1q3ES2OczmW6htiaaJuto0eEnOKlN7vPrrU_L9Mv-avcWLz9f32fMihpTyPmalSKlMsjznTCoQvBBoGPBMyLKQpjA8q5SCkpYpzWQKeVoEIRSihCIHEMmU3Iy-4ZyfLfper9uta8JKzWnKUillEkhiJIFrvXdY6c7ZjXF7zagestKHrPQQhFZKH7LSKug-Rp3DDuEowvDWrUOvdzoxjKnw7wek1ABtKB6qG3oeEKV61W-C2-PohiGPnUWnPVhsAEvrEHpdtvafe34BFtOIxw</recordid><startdate>19991201</startdate><enddate>19991201</enddate><creator>Zachariasen, Martin</creator><general>Elsevier B.V</general><general>Elsevier</general><general>Elsevier Sequoia S.A</general><scope>DKI</scope><scope>X2L</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19991201</creationdate><title>Local search for the Steiner tree problem in the Euclidean plane</title><author>Zachariasen, Martin</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c402t-1d540637882169c52b5ea1c2756db6aba27f99cd0d40764c84bc40cb5dcb8cc53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1999</creationdate><topic>Algorithms</topic><topic>Heuristic</topic><topic>Heuristics</topic><topic>Local search</topic><topic>Operations research</topic><topic>Steiner trees</topic><topic>Studies</topic><topic>Survey</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zachariasen, Martin</creatorcontrib><collection>RePEc IDEAS</collection><collection>RePEc</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>European journal of operational research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zachariasen, Martin</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Local search for the Steiner tree problem in the Euclidean plane</atitle><jtitle>European journal of operational research</jtitle><date>1999-12-01</date><risdate>1999</risdate><volume>119</volume><issue>2</issue><spage>282</spage><epage>300</epage><pages>282-300</pages><issn>0377-2217</issn><eissn>1872-6860</eissn><coden>EJORDT</coden><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.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/S0377-2217(99)00131-9</doi><tpages>19</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0377-2217 |
| ispartof | European journal of operational research, 1999-12, Vol.119 (2), p.282-300 |
| issn | 0377-2217 1872-6860 |
| language | eng |
| recordid | cdi_proquest_journals_204146663 |
| source | RePEc; Elsevier ScienceDirect Journals |
| subjects | Algorithms Heuristic Heuristics Local search Operations research Steiner trees Studies Survey |
| title | Local search for the Steiner tree problem in the Euclidean plane |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-18T13%3A50%3A57IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Local%20search%20for%20the%20Steiner%20tree%20problem%20in%20the%20Euclidean%20plane&rft.jtitle=European%20journal%20of%20operational%20research&rft.au=Zachariasen,%20Martin&rft.date=1999-12-01&rft.volume=119&rft.issue=2&rft.spage=282&rft.epage=300&rft.pages=282-300&rft.issn=0377-2217&rft.eissn=1872-6860&rft.coden=EJORDT&rft_id=info:doi/10.1016/S0377-2217(99)00131-9&rft_dat=%3Cproquest_cross%3E50958521%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=204146663&rft_id=info:pmid/&rft_els_id=S0377221799001319&rfr_iscdi=true |