{"id":"https://openalex.org/W2485276403","doi":"https://doi.org/10.1145/2908812.2908860","title":"A Population-based Local Search Technique with Random Descent and Jump for the Steiner Tree Problem in Graphs","display_name":"A Population-based Local Search Technique with Random Descent and Jump for the Steiner Tree Problem in Graphs","publication_year":2016,"publication_date":"2016-07-20","ids":{"openalex":"https://openalex.org/W2485276403","doi":"https://doi.org/10.1145/2908812.2908860","mag":"2485276403"},"language":"en","primary_location":{"id":"doi:10.1145/2908812.2908860","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2908812.2908860","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference 2016","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://figshare.com/articles/conference_contribution/A_population-based_local_search_technique_with_random_descent_and_jump_for_the_Steiner_tree_problem_in_graphs/27395241","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035800350","display_name":"Angus Kenny","orcid":null},"institutions":[{"id":"https://openalex.org/I82951845","display_name":"RMIT University","ror":"https://ror.org/04ttjf776","country_code":"AU","type":"education","lineage":["https://openalex.org/I82951845"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Angus Kenny","raw_affiliation_strings":["RMIT University, Melbourne, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"RMIT University, Melbourne, Australia","institution_ids":["https://openalex.org/I82951845"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100369719","display_name":"Xiaodong Li","orcid":"https://orcid.org/0000-0003-0346-1526"},"institutions":[{"id":"https://openalex.org/I82951845","display_name":"RMIT University","ror":"https://ror.org/04ttjf776","country_code":"AU","type":"education","lineage":["https://openalex.org/I82951845"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Xiaodong Li","raw_affiliation_strings":["RMIT University, Melbourne, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"RMIT University, Melbourne, Australia","institution_ids":["https://openalex.org/I82951845"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006614329","display_name":"A. K. Qin","orcid":"https://orcid.org/0000-0001-6631-1651"},"institutions":[{"id":"https://openalex.org/I82951845","display_name":"RMIT University","ror":"https://ror.org/04ttjf776","country_code":"AU","type":"education","lineage":["https://openalex.org/I82951845"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"A K. Qin","raw_affiliation_strings":["RMIT University, Melbourne, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"RMIT University, Melbourne, Australia","institution_ids":["https://openalex.org/I82951845"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037240301","display_name":"Andreas Ernst","orcid":"https://orcid.org/0000-0002-1101-8359"},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Andreas T. Ernst","raw_affiliation_strings":["Monash University, Melbourne, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Monash University, Melbourne, Australia","institution_ids":["https://openalex.org/I56590836"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"333","last_page":"340"},"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.9988999962806702,"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.9988999962806702,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9907000064849854,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.8820937275886536},{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.7114408612251282},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.6673149466514587},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6463420391082764},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.6247839331626892},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5308013558387756},{"id":"https://openalex.org/keywords/jump","display_name":"Jump","score":0.5268282294273376},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4972567856311798},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.48625433444976807},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4421055316925049},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38539183139801025},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34494730830192566},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.12376725673675537}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8820937275886536},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.7114408612251282},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.6673149466514587},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6463420391082764},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.6247839331626892},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5308013558387756},{"id":"https://openalex.org/C2780695682","wikidata":"https://www.wikidata.org/wiki/Q4005959","display_name":"Jump","level":2,"score":0.5268282294273376},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4972567856311798},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.48625433444976807},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4421055316925049},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38539183139801025},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34494730830192566},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.12376725673675537},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/2908812.2908860","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2908812.2908860","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference 2016","raw_type":"proceedings-article"},{"id":"pmh:oai:alma.61RMIT_INST:11247188890001341","is_oa":false,"landing_page_url":"http://doi.org/10.1145/2908812.2908860","pdf_url":null,"source":{"id":"https://openalex.org/S4306402074","display_name":"RMIT Research Repository (RMIT University Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I82951845","host_organization_name":"RMIT University","host_organization_lineage":["https://openalex.org/I82951845"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:figshare.com:article/27395241","is_oa":true,"landing_page_url":"https://figshare.com/articles/conference_contribution/A_population-based_local_search_technique_with_random_descent_and_jump_for_the_Steiner_tree_problem_in_graphs/27395241","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference contribution"},{"id":"pmh:oai:researchbank.swinburne.edu.au:914c6a6a-4774-4ef1-9d17-821144bb44b9/1","is_oa":false,"landing_page_url":"http://hdl.handle.net/1959.3/438523","pdf_url":null,"source":{"id":"https://openalex.org/S4306401157","display_name":"Swinburne Research Bank (Swinburne University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I57093077","host_organization_name":"Swinburne University of Technology","host_organization_lineage":["https://openalex.org/I57093077"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference 2016 (GECCO '16), Denver, Colorado, United States, 20 - 24 July, 2016 / Tobias Friedrich (ed.), pp. 333-340","raw_type":null}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/27395241","is_oa":true,"landing_page_url":"https://figshare.com/articles/conference_contribution/A_population-based_local_search_technique_with_random_descent_and_jump_for_the_Steiner_tree_problem_in_graphs/27395241","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference contribution"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W23087583","https://openalex.org/W124060458","https://openalex.org/W132245160","https://openalex.org/W170485943","https://openalex.org/W1539964999","https://openalex.org/W1588351583","https://openalex.org/W1680797894","https://openalex.org/W1992380975","https://openalex.org/W2007351477","https://openalex.org/W2007572995","https://openalex.org/W2011164066","https://openalex.org/W2017927472","https://openalex.org/W2019357066","https://openalex.org/W2020643293","https://openalex.org/W2039706936","https://openalex.org/W2042492403","https://openalex.org/W2049967755","https://openalex.org/W2086182566","https://openalex.org/W2090275183","https://openalex.org/W2122990988","https://openalex.org/W2147534455","https://openalex.org/W2169528473","https://openalex.org/W2189656425","https://openalex.org/W2218699483","https://openalex.org/W2277622081","https://openalex.org/W2334819359","https://openalex.org/W2401610261","https://openalex.org/W2402846924","https://openalex.org/W2436071425","https://openalex.org/W2484306690","https://openalex.org/W2887022906","https://openalex.org/W2916783606","https://openalex.org/W3127447045","https://openalex.org/W4254682885","https://openalex.org/W6600963818","https://openalex.org/W6632184465","https://openalex.org/W6648563651","https://openalex.org/W6682642761","https://openalex.org/W6772300552","https://openalex.org/W7019423794"],"related_works":["https://openalex.org/W3205136130","https://openalex.org/W1575663621","https://openalex.org/W2807679627","https://openalex.org/W2053228469","https://openalex.org/W1604727913","https://openalex.org/W2133301106","https://openalex.org/W2039568841","https://openalex.org/W2046609661","https://openalex.org/W2006721481","https://openalex.org/W2041490059"],"abstract_inverted_index":{"The":[0],"Steiner":[1],"tree":[2],"problem":[3,13,33],"in":[4,17,72,106,137],"graphs":[5],"(STPG)":[6],"is":[7,85,110,132],"a":[8,73,79],"well":[9],"known":[10],"NP-hard":[11],"combinatorial":[12],"with":[14,49,93],"various":[15],"applications":[16],"transport,":[18],"computational":[19],"biology,":[20],"network":[21],"and":[22,123,131],"VLSI":[23],"design.":[24],"Exact":[25],"methods":[26],"have":[27],"been":[28,61],"developed":[29],"to":[30,34,67,134],"solve":[31],"this":[32,57],"proven":[35],"optimality,":[36],"however":[37],"the":[38,53,91,101,116,128],"exponential":[39],"nature":[40],"of":[41,52,56,88],"these":[42],"algorithms":[43],"mean":[44],"that":[45],"they":[46],"become":[47],"intractable":[48],"large-scale":[50],"instances":[51],"problem.":[54],"Because":[55],"phenomenon,":[58],"there":[59],"has":[60],"considerable":[62],"research":[63],"into":[64],"using":[65],"metaheuristics":[66],"obtain":[68],"good":[69],"quality":[70],"solutions":[71],"reasonable":[74],"time.":[75],"This":[76],"paper":[77],"presents":[78],"hybrid":[80,117],"local":[81,107,114,118],"search":[82,119],"technique":[83,120],"which":[84,99],"an":[86,94],"extension":[87],"techniques":[89,126],"from":[90,103,127],"literature":[92,130],"added":[95],"random":[96],"jump":[97],"operator":[98],"prevents":[100],"algorithm":[102],"becoming":[104],"stuck":[105],"minima.":[108],"It":[109],"compared":[111],"against":[112],"greedy":[113],"search,":[115],"it":[121],"extends":[122],"two":[124],"metaheuristic":[125],"current":[129],"shown":[133],"outperform":[135],"them":[136],"nearly":[138],"all":[139],"cases.":[140]},"counts_by_year":[],"updated_date":"2026-07-19T07:52:34.831488","created_date":"2025-10-10T00:00:00"}