{"id":"https://openalex.org/W1981480054","doi":"https://doi.org/10.1145/2739482.2764676","title":"Solving Euclidean Steiner Tree Problems with Multi Swarm Optimization","display_name":"Solving Euclidean Steiner Tree Problems with Multi Swarm Optimization","publication_year":2015,"publication_date":"2015-07-10","ids":{"openalex":"https://openalex.org/W1981480054","doi":"https://doi.org/10.1145/2739482.2764676","mag":"1981480054"},"language":"en","primary_location":{"id":"doi:10.1145/2739482.2764676","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2739482.2764676","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://lirias.kuleuven.be/handle/123456789/561087","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050743021","display_name":"Tom Decroos","orcid":null},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"Tom Decroos","raw_affiliation_strings":["KU Leuven, Leuven, Belgium","KU Leuven, Leuven (Belgium)"],"affiliations":[{"raw_affiliation_string":"KU Leuven, Leuven, Belgium","institution_ids":["https://openalex.org/I99464096"]},{"raw_affiliation_string":"KU Leuven, Leuven (Belgium)","institution_ids":["https://openalex.org/I99464096"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074966723","display_name":"Patrick De Causmaecker","orcid":"https://orcid.org/0000-0002-6763-1945"},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Patrick De Causmaecker","raw_affiliation_strings":["KU Leuven, Leuven, Belgium","KU Leuven, Leuven (Belgium)"],"affiliations":[{"raw_affiliation_string":"KU Leuven, Leuven, Belgium","institution_ids":["https://openalex.org/I99464096"]},{"raw_affiliation_string":"KU Leuven, Leuven (Belgium)","institution_ids":["https://openalex.org/I99464096"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110447732","display_name":"Bart Demoen","orcid":null},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Bart Demoen","raw_affiliation_strings":["KU Leuven, Leuven, Belgium","KU Leuven, Leuven (Belgium)"],"affiliations":[{"raw_affiliation_string":"KU Leuven, Leuven, Belgium","institution_ids":["https://openalex.org/I99464096"]},{"raw_affiliation_string":"KU Leuven, Leuven (Belgium)","institution_ids":["https://openalex.org/I99464096"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5050743021"],"corresponding_institution_ids":["https://openalex.org/I99464096"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.05615751,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1379","last_page":"1380"},"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.9984999895095825,"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.9984999895095825,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9725000262260437,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11880","display_name":"Forest ecology and management","score":0.9456999897956848,"subfield":{"id":"https://openalex.org/subfields/2309","display_name":"Nature and Landscape Conservation"},"field":{"id":"https://openalex.org/fields/23","display_name":"Environmental 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.9616090655326843},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6658732891082764},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.6265861988067627},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.6234332919120789},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5727038383483887},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5711873769760132},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.5650742053985596},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5416706800460815},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4794982075691223},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.4730842709541321},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.46060067415237427},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.43056726455688477},{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.42078739404678345},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39679771661758423},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32985788583755493},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.2523205280303955},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.23075568675994873},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2246035635471344},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.10737437009811401}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9616090655326843},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6658732891082764},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.6265861988067627},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.6234332919120789},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5727038383483887},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5711873769760132},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.5650742053985596},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5416706800460815},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4794982075691223},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.4730842709541321},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.46060067415237427},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.43056726455688477},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.42078739404678345},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39679771661758423},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32985788583755493},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2523205280303955},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.23075568675994873},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2246035635471344},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.10737437009811401},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2739482.2764676","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2739482.2764676","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:lirias2repo.kuleuven.be:123456789/561087","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/123456789/561087","pdf_url":null,"source":{"id":"https://openalex.org/S4306401954","display_name":"Lirias (KU Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"GECCO (Genetic and Evolutionary Computation Conference), Madrid, Spain, 11-15 July 2015","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:lirias2repo.kuleuven.be:123456789/473764","is_oa":true,"landing_page_url":"http://www.cs.kuleuven.be/publicaties/rapporten/cw/CW678.abs.html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401954","display_name":"Lirias (KU Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"CW Reports, Report No. CW678","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:lirias2repo.kuleuven.be:123456789/561087","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/123456789/561087","pdf_url":null,"source":{"id":"https://openalex.org/S4306401954","display_name":"Lirias (KU Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"GECCO (Genetic and Evolutionary Computation Conference), Madrid, Spain, 11-15 July 2015","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1680797894","https://openalex.org/W2049967755","https://openalex.org/W2171603211","https://openalex.org/W2402846924","https://openalex.org/W2480138299","https://openalex.org/W3026271233"],"related_works":["https://openalex.org/W2943635264","https://openalex.org/W1978034843","https://openalex.org/W2518240130","https://openalex.org/W2058332489","https://openalex.org/W3081212354","https://openalex.org/W2092979316","https://openalex.org/W2353822696","https://openalex.org/W1981480054","https://openalex.org/W2120881403","https://openalex.org/W2095481180"],"abstract_inverted_index":{"A":[0],"new":[1],"iterative":[2],"heuristic":[3,60],"algorithm,":[4],"based":[5],"on":[6],"Multi":[7],"Swarm":[8],"Optimization,":[9],"is":[10,25,45],"presented":[11],"for":[12,28,50,61],"Steiner":[13,53,93],"Tree":[14,54,94],"Problems":[15],"(STP)":[16],"in":[17],"the":[18,51,62,92],"2-dimensional":[19],"Euclidean":[20],"plane.":[21],"The":[22,42,69,79],"basic":[23],"algorithm":[24,70],"made":[26],"practical":[27],"large":[29],"instances":[30],"by":[31],"applying":[32],"a":[33,39,58,65],"result":[34],"from":[35],"graph":[36],"theory,":[37],"and":[38,56,87],"well-informed":[40],"approximation.":[41],"algorithm's":[43],"performance":[44],"compared":[46],"to":[47,57,84,88],"perfect":[48],"solutions":[49,75],"classic":[52],"Problem":[55],"deterministic":[59],"k-bottleneck":[63],"STP,":[64],"variant":[66],"of":[67,91],"STP.":[68],"often":[71],"produces":[72],"near":[73],"optimal":[74],"with":[76],"limited":[77],"resources.":[78],"approach":[80],"can":[81],"be":[82],"applied":[83],"higher":[85],"dimensions":[86],"other":[89],"variants":[90],"Problem.":[95]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}