{"id":"https://openalex.org/W2086182566","doi":"https://doi.org/10.1109/rivf.2013.6719887","title":"An ant colony optimization algorithm for solving Group Steiner Problem","display_name":"An ant colony optimization algorithm for solving Group Steiner Problem","publication_year":2013,"publication_date":"2013-11-01","ids":{"openalex":"https://openalex.org/W2086182566","doi":"https://doi.org/10.1109/rivf.2013.6719887","mag":"2086182566"},"language":"en","primary_location":{"id":"doi:10.1109/rivf.2013.6719887","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rivf.2013.6719887","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051495094","display_name":"Thai-Duong Nguyen","orcid":null},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Thai-Duong Nguyen","raw_affiliation_strings":["School of Information and Communication Technology, Hanoi University of Science and Technology, Vietnam","[School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information and Communication Technology, Hanoi University of Science and Technology, Vietnam","institution_ids":["https://openalex.org/I94518387"]},{"raw_affiliation_string":"[School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam]","institution_ids":["https://openalex.org/I94518387"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025397806","display_name":"Phan-Thuan Do","orcid":null},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Phan-Thuan Do","raw_affiliation_strings":["School of Information and Communication Technology, Hanoi University of Science and Technology, Vietnam","[School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information and Communication Technology, Hanoi University of Science and Technology, Vietnam","institution_ids":["https://openalex.org/I94518387"]},{"raw_affiliation_string":"[School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam]","institution_ids":["https://openalex.org/I94518387"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I94518387"],"apc_list":null,"apc_paid":null,"fwci":0.4576,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.61523106,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"28","issue":null,"first_page":"163","last_page":"168"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9962999820709229,"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.9962999820709229,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9886999726295471,"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.9760000109672546,"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.782188892364502},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.7188282012939453},{"id":"https://openalex.org/keywords/very-large-scale-integration","display_name":"Very-large-scale integration","score":0.6294661164283752},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6037319898605347},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.591456413269043},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5613721609115601},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5600200295448303},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49057167768478394},{"id":"https://openalex.org/keywords/group","display_name":"Group (periodic table)","score":0.4489915072917938},{"id":"https://openalex.org/keywords/extremal-optimization","display_name":"Extremal optimization","score":0.4300828278064728},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.4100169241428375},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3073919415473938},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29633820056915283},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1329655647277832},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.09993889927864075}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.782188892364502},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7188282012939453},{"id":"https://openalex.org/C14580979","wikidata":"https://www.wikidata.org/wiki/Q876049","display_name":"Very-large-scale integration","level":2,"score":0.6294661164283752},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6037319898605347},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.591456413269043},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5613721609115601},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5600200295448303},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49057167768478394},{"id":"https://openalex.org/C2781311116","wikidata":"https://www.wikidata.org/wiki/Q83306","display_name":"Group (periodic table)","level":2,"score":0.4489915072917938},{"id":"https://openalex.org/C188919014","wikidata":"https://www.wikidata.org/wiki/Q5422296","display_name":"Extremal optimization","level":4,"score":0.4300828278064728},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.4100169241428375},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3073919415473938},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29633820056915283},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1329655647277832},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.09993889927864075},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/rivf.2013.6719887","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rivf.2013.6719887","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1541239238","https://openalex.org/W1573676079","https://openalex.org/W1591968161","https://openalex.org/W1801849579","https://openalex.org/W1986201860","https://openalex.org/W2020427431","https://openalex.org/W2051769150","https://openalex.org/W2071050202","https://openalex.org/W2165541052","https://openalex.org/W2172255557","https://openalex.org/W2275351491","https://openalex.org/W2610052675","https://openalex.org/W4246219036","https://openalex.org/W4292083457","https://openalex.org/W6635600818","https://openalex.org/W6684133662"],"related_works":["https://openalex.org/W4236115276","https://openalex.org/W1547053391","https://openalex.org/W2156728385","https://openalex.org/W1521781013","https://openalex.org/W2039706936","https://openalex.org/W46882622","https://openalex.org/W1611875833","https://openalex.org/W1975009952","https://openalex.org/W1588949866","https://openalex.org/W2462483068"],"abstract_inverted_index":{"Group":[0],"Steiner":[1],"Problem":[2],"(GSP)":[3],"is":[4],"an":[5,66],"important":[6],"generalization":[7],"of":[8,26,34,43,60],"some":[9],"basic":[10],"NP-hard":[11],"problems.":[12],"Many":[13],"complex":[14],"real-world":[15],"applications":[16],"require":[17],"solving":[18],"the":[19,24,27,32,41,73,87],"GSP":[20,74],"in":[21,75],"graphs":[22],"modeling":[23],"topology":[25],"given":[28],"problem,":[29],"such":[30],"as:":[31],"design":[33,42,59],"Very":[35],"Large":[36],"Scale":[37],"Integration":[38],"(VLSI)":[39],"circuits,":[40],"a":[44,61],"minimal":[45],"length":[46],"irrigation":[47],"network,":[48],"and":[49],"routing":[50],"problems":[51],"for":[52,92],"wireless":[53],"sensor":[54],"networks.":[55],"We":[56],"show":[57,81],"our":[58,83],"new":[62],"algorithm":[63],"based":[64],"on":[65],"Ant":[67],"Colony":[68],"Optimization":[69],"model":[70],"to":[71],"solve":[72],"general":[76],"graphs.":[77],"Our":[78],"experimental":[79],"results":[80],"that":[82],"method":[84],"strongly":[85],"outperforms":[86],"best":[88],"other":[89],"heuristic":[90],"methods":[91],"GSP.":[93]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}