{"id":"https://openalex.org/W2967913112","doi":"https://doi.org/10.1109/cec.2019.8790070","title":"A Heuristic Based on Randomized Greedy Algorithms for the Clustered Shortest-Path Tree Problem","display_name":"A Heuristic Based on Randomized Greedy Algorithms for the Clustered Shortest-Path Tree Problem","publication_year":2019,"publication_date":"2019-06-01","ids":{"openalex":"https://openalex.org/W2967913112","doi":"https://doi.org/10.1109/cec.2019.8790070","mag":"2967913112"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2019.8790070","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2019.8790070","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2005.04095","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Pham Dinh Thanh","orcid":null},"institutions":[{"id":"https://openalex.org/I4210139842","display_name":"Tay Bac University","ror":"https://ror.org/04j5g5g52","country_code":"VN","type":"education","lineage":["https://openalex.org/I4210139842"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Pham Dinh Thanh","raw_affiliation_strings":["Faculty of Mathematics - Physics - Informatic, Taybac University, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics - Physics - Informatic, Taybac University, Vietnam","institution_ids":["https://openalex.org/I4210139842"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Huynh Thi Thanh Binh","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":"Huynh Thi Thanh Binh","raw_affiliation_strings":["School of Information and Communication Technology, Hanoi University of Science and Technology, 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"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Do Dinh Dac","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":"Do Dinh Dac","raw_affiliation_strings":["School of Information and Communication Technology, Hanoi University of Science and Technology, 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"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Nguyen Binh Long","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":"Nguyen Binh Long","raw_affiliation_strings":["School of Information and Communication Technology, Hanoi University of Science and Technology, 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"]}]},{"author_position":"last","author":{"id":null,"display_name":"Le Minh Hai Phong","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":"Le Minh Hai Phong","raw_affiliation_strings":["School of Information and Communication Technology, Hanoi University of Science and Technology, 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"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7265,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.72030516,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"2915","last_page":"2922"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13429","display_name":"Electricity Theft Detection Techniques","score":0.995199978351593,"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/T13429","display_name":"Electricity Theft Detection Techniques","score":0.995199978351593,"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/T11606","display_name":"Infrastructure Maintenance and Monitoring","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural 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/T12707","display_name":"Vehicle License Plate Recognition","score":0.9926999807357788,"subfield":{"id":"https://openalex.org/subfields/2214","display_name":"Media Technology"},"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/greedy-algorithm","display_name":"Greedy algorithm","score":0.6211000084877014},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5615000128746033},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5609999895095825},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5218999981880188},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.5},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.39959999918937683},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.3815000057220459},{"id":"https://openalex.org/keywords/greedy-randomized-adaptive-search-procedure","display_name":"Greedy randomized adaptive search procedure","score":0.38019999861717224}],"concepts":[{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6211000084877014},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5677000284194946},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5615000128746033},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5609999895095825},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5218999981880188},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.5},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4781000018119812},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47620001435279846},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4498000144958496},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.39959999918937683},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.3815000057220459},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.38019999861717224},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.32690000534057617},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.301800012588501},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.30059999227523804},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.3000999987125397},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.28769999742507935},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2766999900341034},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.27630001306533813},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.2639999985694885},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.2567000091075897},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.25600001215934753},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.25380000472068787},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.25290000438690186}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cec.2019.8790070","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2019.8790070","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2005.04095","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2005.04095","pdf_url":"https://arxiv.org/pdf/2005.04095","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2005.04095","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2005.04095","pdf_url":"https://arxiv.org/pdf/2005.04095","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1481869366","https://openalex.org/W1524271395","https://openalex.org/W1970411956","https://openalex.org/W1984230346","https://openalex.org/W1990431753","https://openalex.org/W2031673408","https://openalex.org/W2072270250","https://openalex.org/W2090142081","https://openalex.org/W2109293843","https://openalex.org/W2110009764","https://openalex.org/W2153401898","https://openalex.org/W2252840007","https://openalex.org/W2744216431","https://openalex.org/W2745690522","https://openalex.org/W2809828719","https://openalex.org/W2897353395","https://openalex.org/W4211130072","https://openalex.org/W6709053981","https://openalex.org/W6754547286","https://openalex.org/W6881873539","https://openalex.org/W7036404539"],"related_works":[],"abstract_inverted_index":{"Randomized":[0],"Greedy":[1],"Algorithms":[2],"(RGAs)":[3],"are":[4,20,87,107],"interesting":[5],"approaches":[6],"incorporating":[7],"the":[8,12,39,53,67,75,80,91,97,100,113,116,128,131,134,137],"random":[9],"processes":[10],"into":[11],"greedy":[13],"algorithms":[14],"to":[15,50,65,89],"solve":[16],"problems":[17,27],"whose":[18],"structures":[19],"not":[21],"well":[22,25],"understood":[23],"as":[24,26],"in":[28,71,119],"combinatorial":[29],"optimization.":[30],"This":[31],"paper":[32],"introduces":[33],"a":[34],"new":[35],"algorithm":[36,118],"that":[37],"combines":[38],"major":[40],"features":[41],"of":[42,79,85,99,104,115,130,136],"RGAs":[43,81],"and":[44,82],"Shortest":[45],"Path":[46],"Tree":[47,56],"Algorithm":[48],"(SPTA)":[49],"deal":[51],"with":[52,121],"Clustered":[54],"Shortest-Path":[55],"Problem":[57],"(CluSPT).":[58],"In":[59],"our":[60],"algorithm,":[61,101],"SPTA":[62,86],"is":[63],"used":[64,88],"determine":[66],"shortest":[68],"path":[69],"tree":[70],"each":[72],"cluster":[73],"while":[74],"combination":[76],"between":[77],"characteristics":[78],"search":[83],"strategy":[84],"construct":[90],"edges":[92],"connecting":[93],"clusters.":[94],"To":[95],"evaluate":[96],"performance":[98,135],"various":[102],"types":[103],"Euclidean":[105],"benchmarks":[106],"selected.":[108],"The":[109],"experimental":[110],"results":[111],"show":[112],"strengths":[114],"proposed":[117],"comparison":[120],"some":[122],"existing":[123],"algorithms.":[124],"We":[125],"also":[126],"analyze":[127],"influences":[129],"parameters":[132],"on":[133],"algorithm.":[138]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2019-08-22T00:00:00"}