{"id":"https://openalex.org/W2995051610","doi":"https://doi.org/10.1145/3368926.3369712","title":"Multifactorial Evolutionary Algorithm For Clustered Minimum Routing Cost Problem","display_name":"Multifactorial Evolutionary Algorithm For Clustered Minimum Routing Cost Problem","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2995051610","doi":"https://doi.org/10.1145/3368926.3369712","mag":"2995051610"},"language":"en","primary_location":{"id":"doi:10.1145/3368926.3369712","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3368926.3369712","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Tenth International Symposium on Information and Communication Technology  - SoICT 2019","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1912.10986","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Tran Ba Trung","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":true,"raw_author_name":"Tran Ba Trung","raw_affiliation_strings":["School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam"],"affiliations":[{"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":"middle","author":{"id":null,"display_name":"Le Tien Thanh","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 Tien Thanh","raw_affiliation_strings":["School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam"],"affiliations":[{"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":"middle","author":{"id":null,"display_name":"Ly Trung Hieu","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":"Ly Trung Hieu","raw_affiliation_strings":["School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam"],"affiliations":[{"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":"middle","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":["Tay Bac University, Sonla, Vietnam"],"affiliations":[{"raw_affiliation_string":"Tay Bac University, Sonla, Vietnam","institution_ids":["https://openalex.org/I4210139842"]}]},{"author_position":"last","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, Hanoi, Vietnam"],"affiliations":[{"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":5,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I94518387"],"apc_list":null,"apc_paid":null,"fwci":0.6619,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.77693109,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"170","last_page":"177"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9966999888420105,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9966999888420105,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9952999949455261,"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.9902999997138977,"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/crossover","display_name":"Crossover","score":0.7128999829292297},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6341000199317932},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5892999768257141},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5874999761581421},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.5565000176429749},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.5351999998092651},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.45399999618530273},{"id":"https://openalex.org/keywords/mutation","display_name":"Mutation","score":0.43880000710487366}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.7128999829292297},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6341000199317932},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6244999766349792},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5892999768257141},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5874999761581421},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.5565000176429749},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.5351999998092651},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5095999836921692},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.45399999618530273},{"id":"https://openalex.org/C501734568","wikidata":"https://www.wikidata.org/wiki/Q42918","display_name":"Mutation","level":3,"score":0.43880000710487366},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4318999946117401},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.42500001192092896},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.361299991607666},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3264000117778778},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.3059000074863434},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.30160000920295715},{"id":"https://openalex.org/C2778334786","wikidata":"https://www.wikidata.org/wiki/Q1586270","display_name":"Variation (astronomy)","level":2,"score":0.29010000824928284},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.27140000462532043},{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.25459998846054077},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.25099998712539673}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3368926.3369712","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3368926.3369712","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Tenth International Symposium on Information and Communication Technology  - SoICT 2019","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1912.10986","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1912.10986","pdf_url":"https://arxiv.org/pdf/1912.10986","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:1912.10986","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1912.10986","pdf_url":"https://arxiv.org/pdf/1912.10986","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":2,"referenced_works":["https://openalex.org/W2101775461","https://openalex.org/W6887879668"],"related_works":[],"abstract_inverted_index":{"Minimum":[0],"Routing":[1],"Cost":[2],"Clustered":[3],"Tree":[4],"Problem":[5],"(CluMRCT)":[6],"is":[7,20,133],"applied":[8],"in":[9,12,87,97],"various":[10],"fields":[11],"both":[13],"theory":[14],"and":[15,76],"application.":[16],"Because":[17],"the":[18,22,29,44,69,100,113,125,144,147],"CluMRCT":[19,66,85,128],"NP-Hard,":[21],"approximate":[23],"approaches":[24],"are":[25],"suitable":[26],"to":[27,49,61],"find":[28],"solution":[30,83],"for":[31,64,95,107],"this":[32,58],"problem.":[33],"Recently,":[34],"Multifactorial":[35],"Evolutionary":[36],"Algorithm":[37],"(MFEA)":[38],"has":[39],"emerged":[40],"as":[41],"one":[42],"of":[43,55,84,123,127,138,146],"most":[45],"efficient":[46],"approximation":[47],"algorithms":[48],"deal":[50],"with":[51],"many":[52],"different":[53],"kinds":[54],"problems.":[56,67],"Therefore,":[57],"paper":[59],"studies":[60],"apply":[62],"MFEA":[63],"solving":[65],"In":[68],"proposed":[70,131,148],"MFEA,":[71],"we":[72,116],"focus":[73],"on":[74,135,151],"crossover":[75],"mutation":[77],"operators":[78],"which":[79],"create":[80],"a":[81,104,120],"valid":[82],"problem":[86],"two":[88],"levels:":[89],"first":[90],"level":[91,102],"constructs":[92],"spanning":[93,105],"trees":[94],"graphs":[96],"clusters":[98],"while":[99],"second":[101],"builds":[103],"tree":[106],"connecting":[108],"among":[109],"clusters.":[110],"To":[111],"reduce":[112],"consuming":[114],"resources,":[115],"will":[117],"also":[118],"introduce":[119],"new":[121],"method":[122],"calculating":[124],"cost":[126],"solution.":[129],"The":[130,140],"algorithm":[132],"experimented":[134],"numerous":[136],"types":[137],"datasets.":[139],"experimental":[141],"results":[142],"demonstrate":[143],"effectiveness":[145],"algorithm,":[149],"partially":[150],"large":[152],"instances.":[153]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2019-12-26T00:00:00"}