{"id":"https://openalex.org/W2996973883","doi":"https://doi.org/10.1587/nolta.11.90","title":"Solving the Steiner tree problem in graphs by chaotic search","display_name":"Solving the Steiner tree problem in graphs by chaotic search","publication_year":2019,"publication_date":"2019-12-31","ids":{"openalex":"https://openalex.org/W2996973883","doi":"https://doi.org/10.1587/nolta.11.90","mag":"2996973883"},"language":"en","primary_location":{"id":"doi:10.1587/nolta.11.90","doi":"https://doi.org/10.1587/nolta.11.90","is_oa":true,"landing_page_url":"https://doi.org/10.1587/nolta.11.90","pdf_url":"https://www.jstage.jst.go.jp/article/nolta/11/1/11_90/_pdf","source":{"id":"https://openalex.org/S2764931419","display_name":"Nonlinear Theory and Its Applications IEICE","issn_l":"2185-4106","issn":["2185-4106"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","dongbi-c","poland-20","russia-white-list-4"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Nonlinear Theory and Its Applications, IEICE","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.jstage.jst.go.jp/article/nolta/11/1/11_90/_pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018456406","display_name":"Misa Fujita","orcid":"https://orcid.org/0000-0003-0989-9123","observed_orcids":["https://orcid.org/0000-0003-0989-9123"]},"institutions":[{"id":"https://openalex.org/I161296585","display_name":"Tokyo University of Science","ror":"https://ror.org/05sj3n476","country_code":"JP","type":"education","lineage":["https://openalex.org/I161296585"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Misa Fujita","raw_affiliation_strings":["Department of Management Science, Graduate School of Engineering, Tokyo University of Science"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Management Science, Graduate School of Engineering, Tokyo University of Science","institution_ids":["https://openalex.org/I161296585"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082317183","display_name":"Takayuki Kimura","orcid":"https://orcid.org/0000-0003-0160-6146","observed_orcids":["https://orcid.org/0000-0003-0160-6146"]},"institutions":[{"id":"https://openalex.org/I95053508","display_name":"Nippon Institute of Technology","ror":"https://ror.org/05h68bp56","country_code":"JP","type":"education","lineage":["https://openalex.org/I95053508"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Takayuki Kimura","raw_affiliation_strings":["Department of Electrical, Electronics, and Communication Engineering, Faculty of Fundamental Engineering, Nippon Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical, Electronics, and Communication Engineering, Faculty of Fundamental Engineering, Nippon Institute of Technology","institution_ids":["https://openalex.org/I95053508"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069803426","display_name":"Tohru Ikeguchi","orcid":"https://orcid.org/0000-0001-9280-9541","observed_orcids":["https://orcid.org/0000-0001-9280-9541"]},"institutions":[{"id":"https://openalex.org/I161296585","display_name":"Tokyo University of Science","ror":"https://ror.org/05sj3n476","country_code":"JP","type":"education","lineage":["https://openalex.org/I161296585"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Tohru Ikeguchi","raw_affiliation_strings":["Department of Information and Computer Technology, Faculty of Engineering, Tokyo University of Science","Department of Management Science, Graduate School of Engineering, Tokyo University of Science"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information and Computer Technology, Faculty of Engineering, Tokyo University of Science","institution_ids":["https://openalex.org/I161296585"]},{"raw_affiliation_string":"Department of Management Science, Graduate School of Engineering, Tokyo University of Science","institution_ids":["https://openalex.org/I161296585"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3005,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.60228201,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":96},"biblio":{"volume":"11","issue":"1","first_page":"90","last_page":"108"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.00139999995008111,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.00019999999494757503,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.9449999928474426},{"id":"https://openalex.org/keywords/chaotic-search","display_name":"chaotic search","score":0.9649999737739563},{"id":"https://openalex.org/keywords/chaotic-dynamics","display_name":"chaotic dynamics","score":0.9819999933242798},{"id":"https://openalex.org/keywords/metaheuristic-optimization","display_name":"metaheuristic optimization","score":0.8489999771118164},{"id":"https://openalex.org/keywords/tabu-search","display_name":"tabu search","score":0.8320000171661377},{"id":"https://openalex.org/keywords/np-hard-combinatorial-optimization","display_name":"NP-hard combinatorial optimization","score":0.953000009059906},{"id":"https://openalex.org/keywords/graph-optimization","display_name":"graph optimization","score":0.4959999918937683}],"concepts":[{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.9034067392349243},{"id":"https://openalex.org/C2777052490","wikidata":"https://www.wikidata.org/wiki/Q5072826","display_name":"Chaotic","level":2,"score":0.7450063228607178},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.708234429359436},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.65631502866745},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5851222276687622},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5850942134857178},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.5188466310501099},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5109459757804871},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4929022789001465},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4855777621269226},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4449359178543091},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4424365162849426},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.4364660382270813},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.42713814973831177},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.425295889377594},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13073474168777466},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.10342434048652649},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1587/nolta.11.90","doi":"https://doi.org/10.1587/nolta.11.90","is_oa":true,"landing_page_url":"https://doi.org/10.1587/nolta.11.90","pdf_url":"https://www.jstage.jst.go.jp/article/nolta/11/1/11_90/_pdf","source":{"id":"https://openalex.org/S2764931419","display_name":"Nonlinear Theory and Its Applications IEICE","issn_l":"2185-4106","issn":["2185-4106"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","dongbi-c","poland-20","russia-white-list-4"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Nonlinear Theory and Its Applications, IEICE","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1587/nolta.11.90","doi":"https://doi.org/10.1587/nolta.11.90","is_oa":true,"landing_page_url":"https://doi.org/10.1587/nolta.11.90","pdf_url":"https://www.jstage.jst.go.jp/article/nolta/11/1/11_90/_pdf","source":{"id":"https://openalex.org/S2764931419","display_name":"Nonlinear Theory and Its Applications IEICE","issn_l":"2185-4106","issn":["2185-4106"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","dongbi-c","poland-20","russia-white-list-4"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Nonlinear Theory and Its Applications, IEICE","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G2514072374","display_name":"Network Dynamical System Theory and its Application to Big Data analysis","funder_award_id":"17K00348","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G4705753577","display_name":"A Routing Method Using Nonlinear Dynamical Theory for Large-scale Ride-share Systems","funder_award_id":"19K04395","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G4737018560","display_name":"A Routing Method Using Deterministic Chaos for Large-scale Communication Network Models","funder_award_id":"16K21327","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G7606769720","display_name":"Solving the Steiner tree problem in graphs using the chaotic neural network","funder_award_id":"18J10671","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2996973883.pdf","grobid_xml":"https://content.openalex.org/works/W2996973883.grobid-xml"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W124060458","https://openalex.org/W631131033","https://openalex.org/W944632229","https://openalex.org/W1523786910","https://openalex.org/W1578824783","https://openalex.org/W1582417773","https://openalex.org/W1921871245","https://openalex.org/W1964349383","https://openalex.org/W1965680834","https://openalex.org/W1989665614","https://openalex.org/W1991076067","https://openalex.org/W1991573370","https://openalex.org/W1992442093","https://openalex.org/W2007099865","https://openalex.org/W2019132770","https://openalex.org/W2019357066","https://openalex.org/W2021920818","https://openalex.org/W2038217891","https://openalex.org/W2070181584","https://openalex.org/W2080630520","https://openalex.org/W2087216833","https://openalex.org/W2089280967","https://openalex.org/W2118720660","https://openalex.org/W2152950844","https://openalex.org/W2169528473","https://openalex.org/W2401610261","https://openalex.org/W2490839038","https://openalex.org/W2733034724","https://openalex.org/W2777174142","https://openalex.org/W3127447045","https://openalex.org/W4292880809"],"related_works":["https://openalex.org/W2519937069","https://openalex.org/W7096589027","https://openalex.org/W1967744114","https://openalex.org/W4385815793","https://openalex.org/W1991573370","https://openalex.org/W7096833847","https://openalex.org/W7043727261","https://openalex.org/W1980568536","https://openalex.org/W1533433314","https://openalex.org/W2591903020"],"abstract_inverted_index":{"The":[0],"Steiner":[1,60],"tree":[2,61],"problem":[3,62],"in":[4,63],"graphs":[5,64],"is":[6],"an":[7,34,55],"NP-hard":[8,15],"combinatorial":[9,16],"optimization":[10,17],"problem.":[11],"To":[12],"solve":[13],"the":[14,21,25,30,43,59,69,72,78,83,87,91,102,110,117,126,130,136,143],"problems,":[18,24,28,33],"such":[19],"as":[20,146],"traveling":[22],"salesman":[23],"quadratic":[26],"assignment":[27],"and":[29,116],"vehicle":[31],"routing":[32],"algorithm":[35,56],"for":[36,57],"searching":[37,84,131],"solutions":[38,122],"by":[39],"chaotic":[40,44,66,73,88,103,111,118,137],"dynamics,":[41],"or":[42],"search,":[45,80],"exhibits":[46,113],"good":[47,114],"performance.":[48],"From":[49,90],"this":[50,52],"viewpoint,":[51],"paper":[53],"proposes":[54],"solving":[58],"with":[65,75],"dynamics.":[67],"Comparing":[68],"performance":[70,115],"of":[71,77,86,93,101],"search":[74,104,112,119,128,138,145],"that":[76,98,135],"tabu":[79,127,144],"we":[81,96],"analyze":[82],"characteristics":[85],"search.":[89],"results":[92],"numerical":[94],"experiments,":[95],"found":[97],"if":[99],"parameters":[100],"are":[105],"set":[106],"to":[107],"appropriate":[108],"values,":[109],"outputs":[120],"optimal":[121],"more":[123],"frequently":[124],"than":[125,142],"during":[129],"processes,":[132],"which":[133],"implies":[134],"has":[139],"higher":[140],"ability":[141],"metaheuristics.":[147]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":3}],"updated_date":"2026-11-13T13:42:25.865203","created_date":"2020-01-10T00:00:00"}