{"id":"https://openalex.org/W3174386156","doi":"https://doi.org/10.1145/3449639.3459397","title":"A genetic algorithm approach for the Euclidean Steiner tree problem with soft obstacles","display_name":"A genetic algorithm approach for the Euclidean Steiner tree problem with soft obstacles","publication_year":2021,"publication_date":"2021-06-21","ids":{"openalex":"https://openalex.org/W3174386156","doi":"https://doi.org/10.1145/3449639.3459397","mag":"3174386156"},"language":"en","primary_location":{"id":"doi:10.1145/3449639.3459397","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3449639.3459397","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3449639.3459397","source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3449639.3459397","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033507022","display_name":"Manou Rosenberg","orcid":"https://orcid.org/0000-0002-6013-9990"},"institutions":[{"id":"https://openalex.org/I177877127","display_name":"University of Western Australia","ror":"https://ror.org/047272k79","country_code":"AU","type":"education","lineage":["https://openalex.org/I177877127"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Manou Rosenberg","raw_affiliation_strings":["The University of Western Australia, Perth, Australia"],"affiliations":[{"raw_affiliation_string":"The University of Western Australia, Perth, Australia","institution_ids":["https://openalex.org/I177877127"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030763134","display_name":"Tim French","orcid":"https://orcid.org/0000-0002-0748-8040"},"institutions":[{"id":"https://openalex.org/I177877127","display_name":"University of Western Australia","ror":"https://ror.org/047272k79","country_code":"AU","type":"education","lineage":["https://openalex.org/I177877127"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Tim French","raw_affiliation_strings":["The University of Western Australia, Perth, Australia"],"affiliations":[{"raw_affiliation_string":"The University of Western Australia, Perth, Australia","institution_ids":["https://openalex.org/I177877127"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036930915","display_name":"Mark Reynolds","orcid":"https://orcid.org/0000-0002-5415-0544"},"institutions":[{"id":"https://openalex.org/I177877127","display_name":"University of Western Australia","ror":"https://ror.org/047272k79","country_code":"AU","type":"education","lineage":["https://openalex.org/I177877127"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Mark Reynolds","raw_affiliation_strings":["The University of Western Australia, Perth, Australia"],"affiliations":[{"raw_affiliation_string":"The University of Western Australia, Perth, Australia","institution_ids":["https://openalex.org/I177877127"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026090443","display_name":"Lyndon While","orcid":null},"institutions":[{"id":"https://openalex.org/I177877127","display_name":"University of Western Australia","ror":"https://ror.org/047272k79","country_code":"AU","type":"education","lineage":["https://openalex.org/I177877127"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Lyndon While","raw_affiliation_strings":["The University of Western Australia, Perth, Australia"],"affiliations":[{"raw_affiliation_string":"The University of Western Australia, Perth, Australia","institution_ids":["https://openalex.org/I177877127"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5033507022"],"corresponding_institution_ids":["https://openalex.org/I177877127"],"apc_list":null,"apc_paid":null,"fwci":2.1675,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.86907791,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"618","last_page":"626"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12161","display_name":"Plant Surface Properties and Treatments","score":0.9358000159263611,"subfield":{"id":"https://openalex.org/subfields/1110","display_name":"Plant Science"},"field":{"id":"https://openalex.org/fields/11","display_name":"Agricultural and Biological Sciences"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9171000123023987,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.9254583120346069},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5789636373519897},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.5636945962905884},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5544610619544983},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.520345151424408},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5172879695892334},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.49359095096588135},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49253782629966736},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.4886067509651184},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4803220331668854},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.461637943983078},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.45123961567878723},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44137296080589294},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.4101622700691223},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.37422752380371094},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3634606599807739},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.29510435461997986},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.1870023012161255},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11534270644187927}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9254583120346069},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5789636373519897},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.5636945962905884},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5544610619544983},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.520345151424408},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5172879695892334},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.49359095096588135},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49253782629966736},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.4886067509651184},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4803220331668854},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.461637943983078},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.45123961567878723},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44137296080589294},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.4101622700691223},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.37422752380371094},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3634606599807739},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.29510435461997986},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.1870023012161255},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11534270644187927},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3449639.3459397","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3449639.3459397","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3449639.3459397","source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:publications/e2e49f50-6702-4513-9e1e-8dfc319f1078","is_oa":false,"landing_page_url":"https://research-repository.uwa.edu.au/en/publications/e2e49f50-6702-4513-9e1e-8dfc319f1078","pdf_url":null,"source":{"id":"https://openalex.org/S4306402523","display_name":"UWA Profiles and Research Repository (University of Western Australia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177877127","host_organization_name":"The University of Western Australia","host_organization_lineage":["https://openalex.org/I177877127"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Rosenberg , M , French , T , Reynolds , M & While , L 2021 , A Genetic Algorithm Approach for the Euclidean Steiner Tree Problem with Soft Obstacles . in F Chicano & K Krawiec (eds) , GECCO '21 : Proceedings of the Genetic and Evolutionary Computation Conference . Association for Computing Machinery (ACM) , USA , pp. 618-626 , The Genetic and Evolutionary Computation Conference 2021 , Virtual , 10/07/21 . https://doi.org/10.1145/3449639.3459397","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"doi:10.1145/3449639.3459397","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3449639.3459397","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3449639.3459397","source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320316029","display_name":"Forrest Research Foundation","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3174386156.pdf","grobid_xml":"https://content.openalex.org/works/W3174386156.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W95601016","https://openalex.org/W157468466","https://openalex.org/W1522856549","https://openalex.org/W1538049595","https://openalex.org/W1990488643","https://openalex.org/W2017927472","https://openalex.org/W2023876413","https://openalex.org/W2038537397","https://openalex.org/W2060380213","https://openalex.org/W2071945466","https://openalex.org/W2072865587","https://openalex.org/W2082754320","https://openalex.org/W2087083181","https://openalex.org/W2180570939","https://openalex.org/W2742646968","https://openalex.org/W2808214271","https://openalex.org/W2946739306","https://openalex.org/W4255471253"],"related_works":["https://openalex.org/W1561849181","https://openalex.org/W3187208706","https://openalex.org/W3081212354","https://openalex.org/W1985149601","https://openalex.org/W3116169590","https://openalex.org/W98489388","https://openalex.org/W3101281637","https://openalex.org/W1703428550","https://openalex.org/W1964611452","https://openalex.org/W2390742649"],"abstract_inverted_index":{"In":[0,67],"this":[1,134],"paper":[2],"we":[3],"address":[4],"the":[5,11,14,45,47,56,82,139,159],"Euclidean":[6,23],"Steiner":[7,24,62,160],"tree":[8,25,161],"problem":[9,26,31,135,162],"in":[10,13,35,44,81],"plane":[12,46,83],"presence":[15],"of":[16,41,55,117,146],"soft":[17,164],"and":[18,130,136,166],"solid":[19],"polygonal":[20,101],"obstacles.":[21],"The":[22,149],"is":[27,49],"a":[28,39,52,94,114,123],"well-known":[29],"NP-hard":[30],"with":[32,113,163],"different":[33,147],"applications":[34],"network":[36],"design.":[37],"Given":[38],"set":[40],"terminal":[42],"nodes":[43],"aim":[48],"to":[50,64,77,106,132,153],"find":[51],"shortest-length":[53],"interconnection":[54],"terminals":[57],"allowing":[58],"further":[59,73],"nodes,":[60],"so-called":[61],"points,":[63],"be":[65,78,86,91,98,107],"added.":[66],"many":[68],"real-life":[69],"scenarios":[70,145],"there":[71],"are":[72],"constraints":[74],"that":[75,84,103,126,138],"need":[76,105],"considered.":[79],"Regions":[80],"cannot":[85],"traversed":[87,92],"or":[88,111],"can":[89,97,141],"only":[90],"at":[93],"higher":[95,115],"cost":[96,116],"approximated":[99],"by":[100],"areas":[102],"either":[104],"avoided":[108],"(solid":[109],"obstacles)":[110],"come":[112],"traversing":[118],"(soft":[119],"obstacles).":[120],"We":[121],"propose":[122],"genetic":[124],"algorithm":[125,140],"uses":[127],"problem-specific":[128],"representation":[129],"operators":[131],"solve":[133,142],"show":[137],"various":[143],"test":[144,171],"sizes.":[148],"presented":[150],"approach":[151],"appears":[152],"outperform":[154],"current":[155],"heuristic":[156],"approaches":[157],"for":[158],"obstacles":[165],"was":[167],"evaluated":[168],"on":[169],"larger":[170],"instances":[172],"as":[173],"well.":[174]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}