{"id":"https://openalex.org/W2897353395","doi":"https://doi.org/10.1109/cec.2018.8477684","title":"An Effective Representation Scheme in Multifactorial Evolutionary Algorithm for Solving Cluster Shortest-Path Tree Problem","display_name":"An Effective Representation Scheme in Multifactorial Evolutionary Algorithm for Solving Cluster Shortest-Path Tree Problem","publication_year":2018,"publication_date":"2018-07-01","ids":{"openalex":"https://openalex.org/W2897353395","doi":"https://doi.org/10.1109/cec.2018.8477684","mag":"2897353395"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2018.8477684","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2018.8477684","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"},"type":"article","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/A5037098654","display_name":"Ph\u1ea1m \u0110\u00ecnh Th\u00e0nh","orcid":"https://orcid.org/0000-0002-2550-9546"},"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":true,"raw_author_name":"Pham Dinh Thanh","raw_affiliation_strings":["Faculty of Mathematics - Physics - Informatics, Taybac University, Vietnam"],"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics - Physics - Informatics, Taybac University, Vietnam","institution_ids":["https://openalex.org/I4210139842"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110959319","display_name":"Dinh Anh Dung","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":"Dinh Anh Dung","raw_affiliation_strings":["School of Information and Communication Technology, Hanoi University of Science and Technology, Vietnam"],"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":"https://openalex.org/A5112638719","display_name":"Tran Ngoc Tien","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":"Tran Ngoc Tien","raw_affiliation_strings":["School of Information and Communication Technology, Hanoi University of Science and Technology, Vietnam"],"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":"https://openalex.org/A5072105691","display_name":"Hu\u1ef3nh Th\u1ecb Thanh B\u00ecnh","orcid":"https://orcid.org/0000-0003-1976-6113"},"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"],"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":4,"corresponding_author_ids":["https://openalex.org/A5037098654"],"corresponding_institution_ids":["https://openalex.org/I4210139842"],"apc_list":null,"apc_paid":null,"fwci":2.9319,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.92981362,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9930999875068665,"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.9930999875068665,"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.9921000003814697,"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/T12546","display_name":"Smart Parking Systems Research","score":0.9901000261306763,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/computer-science","display_name":"Computer science","score":0.6718918085098267},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6027728319168091},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5770943760871887},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.48389872908592224},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.45871856808662415},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.45692989230155945},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45486515760421753},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4490273594856262},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.4430127441883087},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.42716872692108154},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42572158575057983},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4204111397266388},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41561025381088257},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2671336531639099},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19180828332901},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.08201813697814941}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6718918085098267},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6027728319168091},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5770943760871887},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.48389872908592224},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.45871856808662415},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.45692989230155945},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45486515760421753},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4490273594856262},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.4430127441883087},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.42716872692108154},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42572158575057983},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4204111397266388},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41561025381088257},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2671336531639099},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19180828332901},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08201813697814941},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2018.8477684","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2018.8477684","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Congress on Evolutionary Computation (CEC)","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":24,"referenced_works":["https://openalex.org/W1077212886","https://openalex.org/W1496687288","https://openalex.org/W1559956479","https://openalex.org/W1574175429","https://openalex.org/W1986593951","https://openalex.org/W1993517873","https://openalex.org/W2031673408","https://openalex.org/W2032789430","https://openalex.org/W2051195253","https://openalex.org/W2067061580","https://openalex.org/W2114809881","https://openalex.org/W2133528322","https://openalex.org/W2142146559","https://openalex.org/W2151924821","https://openalex.org/W2158280690","https://openalex.org/W2322565568","https://openalex.org/W2373493542","https://openalex.org/W2413527939","https://openalex.org/W2526440583","https://openalex.org/W2559562960","https://openalex.org/W2579426115","https://openalex.org/W2586910743","https://openalex.org/W6709053981","https://openalex.org/W6728446499"],"related_works":["https://openalex.org/W17155033","https://openalex.org/W3207760230","https://openalex.org/W1496222301","https://openalex.org/W1590307681","https://openalex.org/W2536018345","https://openalex.org/W4312814274","https://openalex.org/W4285370786","https://openalex.org/W2296488620","https://openalex.org/W2358353312","https://openalex.org/W2353836703"],"abstract_inverted_index":{"The":[0,86,140],"wide":[1],"range":[2],"of":[3,5,26,31,35,91,128,138],"applications":[4],"Cluster":[6,36,40],"Tree":[7,37,42],"Problems":[8],"has":[9],"been":[10],"motivating":[11],"extensive":[12],"research":[13],"into":[14],"various":[15,136],"algorithms":[16],"and":[17,29,60,99],"techniques":[18],"with":[19,77],"a":[20,78],"view":[21],"to":[22,50,73,109,118,124,131],"promoting":[23],"both":[24],"efficiency":[25],"the":[27,39,47,68,75,83,96,111,114,119,126,129],"solving":[28],"qualities":[30],"solutions.":[32,101],"A":[33],"representative":[34],"Problems,":[38],"Shortest-Path":[41],"Problem":[43],"(CSTP)":[44],"arose":[45],"from":[46,113],"practical":[48],"need":[49],"optimize":[51],"network":[52,58],"systems":[53],"such":[54],"as":[55],"irrigation":[56],"systems,":[57],"cables":[59],"distribution":[61],"systems.":[62],"In":[63],"this":[64],"paper,":[65],"we":[66],"proposed":[67,87,130,145],"Multifactorial":[69],"Evolutionary":[70],"Algorithm":[71],"(MFEA)":[72],"approach":[74,103],"CSTP":[76],"representation":[79],"scheme":[80],"based":[81],"on":[82,135,150],"Cayley":[84,92],"Code.":[85],"algorithm":[88,134,146,149],"exploit":[89],"advantages":[90],"Code":[93],"for":[94],"improving":[95],"MFEAs":[97],"performance":[98],"quality":[100],"This":[102],"also":[104],"applied":[105],"new":[106],"decoding":[107],"method":[108],"transform":[110],"solution":[112],"unified":[115],"search":[116],"space":[117],"tasks.":[120],"Experiments":[121],"were":[122],"conducted":[123],"compare":[125],"performances":[127],"another":[132],"approximation":[133],"set":[137],"instances.":[139],"experimental":[141],"results":[142],"show":[143],"that":[144],"surpass":[147],"existing":[148],"almost":[151],"test":[152],"cases.":[153]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}