{"id":"https://openalex.org/W3083272460","doi":"https://doi.org/10.1109/cec48606.2020.9185701","title":"Multifactorial Evolutionary Algorithm for Inter-Domain Path Computation under Domain Uniqueness Constraint","display_name":"Multifactorial Evolutionary Algorithm for Inter-Domain Path Computation under Domain Uniqueness Constraint","publication_year":2020,"publication_date":"2020-07-01","ids":{"openalex":"https://openalex.org/W3083272460","doi":"https://doi.org/10.1109/cec48606.2020.9185701","mag":"3083272460"},"language":"en","primary_location":{"id":"doi:10.1109/cec48606.2020.9185701","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec48606.2020.9185701","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 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/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"],"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":"https://openalex.org/A5004837969","display_name":"Ta Bao Thang","orcid":"https://orcid.org/0000-0003-0167-1263"},"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":"Ta Bao Thangy","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":"https://openalex.org/A5013525455","display_name":"Nguyen Binh Long","orcid":"https://orcid.org/0009-0001-7564-2476"},"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":"middle","author":{"id":"https://openalex.org/A5085359895","display_name":"Ngo Viet Hoang","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":"Ngo Viet Hoang","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":"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":false,"raw_author_name":"Pham Dinh Thanh","raw_affiliation_strings":["Faculty of Natural Science and Technology, Tay Bac University, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Natural Science and Technology, Tay Bac University, Vietnam","institution_ids":["https://openalex.org/I4210139842"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7603,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.88207209,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"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.9492999911308289,"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.9492999911308289,"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/T12321","display_name":"Insect Pheromone Research and Control","score":0.9377999901771545,"subfield":{"id":"https://openalex.org/subfields/1109","display_name":"Insect Science"},"field":{"id":"https://openalex.org/fields/11","display_name":"Agricultural and Biological Sciences"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9355000257492065,"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/computer-science","display_name":"Computer science","score":0.6282245516777039},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.605642557144165},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.535612940788269},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5294007062911987},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5270417332649231},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.4891500771045685},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.46531060338020325},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.45608967542648315},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44622865319252014},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4314344525337219},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.4271544814109802},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.42285069823265076},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3826371729373932},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27059805393218994},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12089893221855164}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6282245516777039},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.605642557144165},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.535612940788269},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5294007062911987},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5270417332649231},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.4891500771045685},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.46531060338020325},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.45608967542648315},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44622865319252014},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4314344525337219},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.4271544814109802},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.42285069823265076},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3826371729373932},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27059805393218994},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12089893221855164},{"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/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec48606.2020.9185701","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec48606.2020.9185701","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 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":25,"referenced_works":["https://openalex.org/W1496687288","https://openalex.org/W1512383952","https://openalex.org/W1519770485","https://openalex.org/W1967879758","https://openalex.org/W2105020099","https://openalex.org/W2119926658","https://openalex.org/W2120530360","https://openalex.org/W2121903617","https://openalex.org/W2128110222","https://openalex.org/W2145292672","https://openalex.org/W2413527939","https://openalex.org/W2526440583","https://openalex.org/W2586910743","https://openalex.org/W2772066451","https://openalex.org/W2810043182","https://openalex.org/W2896215880","https://openalex.org/W2897353395","https://openalex.org/W2902965010","https://openalex.org/W2945963656","https://openalex.org/W2963795223","https://openalex.org/W2999769892","https://openalex.org/W4292240362","https://openalex.org/W6630891747","https://openalex.org/W6728446499","https://openalex.org/W6754547286"],"related_works":["https://openalex.org/W1606499289","https://openalex.org/W1985939653","https://openalex.org/W2911578165","https://openalex.org/W2626282817","https://openalex.org/W4297582752","https://openalex.org/W4285805405","https://openalex.org/W2391924736","https://openalex.org/W3133779647","https://openalex.org/W1560122427","https://openalex.org/W3041827036"],"abstract_inverted_index":{"Nowadays,":[0],"connectivity":[1],"among":[2],"communication":[3],"devices":[4,18,44],"in":[5,51,59,71,202],"networks":[6],"has":[7,73,106],"been":[8],"playing":[9],"a":[10,29,46,146,162,179,210,239],"significant":[11],"role,":[12],"especially":[13],"when":[14,96],"the":[15,37,53,78,82,97,131,151,173,177,185,189,192,195,203,206,231,234,250,254,257,261,264],"number":[16],"of":[17,32,36,55,118,141,176,182,191,200,233,242,245,256,263],"is":[19,40,84,89,99,170],"increasing":[20],"dramatically":[21],"that":[22],"requires":[23],"network":[24,47],"service":[25],"providers":[26],"to":[27,41,92,113,125,129,144,155],"have":[28,138],"better":[30],"architecture":[31],"management":[33],"system.":[34],"One":[35],"popular":[38],"approach":[39,88],"divide":[42],"those":[43],"inside":[45],"into":[48],"different":[49,135,139],"domains,":[50],"which":[52],"problem":[54,70,95],"minimizing":[56],"path":[57],"computation":[58],"general":[60],"or":[61,143],"Inter-Domain":[62],"Path":[63],"Computation":[64],"under":[65],"Domain":[66],"Uniqueness":[67],"constraint":[68],"(IDPC-DU)":[69],"specific":[72],"received":[74],"much":[75],"attention":[76],"from":[77],"research":[79],"community.":[80],"Since":[81],"IDPC-DU":[83,132],"NP-complete,":[85],"an":[86,109],"approximate":[87],"usually":[90],"taken":[91],"tackle":[93],"this":[94],"dimensionality":[98],"high.":[100],"Although":[101],"Multifactorial":[102],"Evolutionary":[103],"Algorithm":[104],"(MFEA)":[105],"emerged":[107],"as":[108,214,216],"effective":[110],"approximation":[111],"algorithm":[112,160,266],"deal":[114],"with":[115,161],"various":[116],"fields":[117],"problems,":[119],"there":[120],"are":[121,267],"still":[122],"some":[123],"difficulties":[124],"apply":[126],"directly":[127],"MFEA":[128,159],"solve":[130],"problem,":[133],"i.e.":[134],"chromosomes":[136],"may":[137],"numbers":[140],"genes":[142],"construct":[145],"feasible":[147],"solution":[148,164],"not":[149],"violating":[150],"problem's":[152],"constraint.":[153],"Therefore,":[154],"overcome":[156],"these":[157],"limitations,":[158],"new":[163,174],"representation":[165,175],"based":[166],"on":[167,238],"Priority-based":[168],"Encoding":[169],"introduced.":[171],"With":[172],"solution,":[178],"chromosome":[180],"consists":[181],"two":[183],"parts:":[184],"first":[186],"part":[187,197],"encodes":[188,198],"priority":[190],"vertex":[193],"while":[194],"second":[196],"information":[199],"edges":[201],"solution.":[204],"Besides,":[205],"paper":[207],"also":[208,268],"proposed":[209,235,258,265],"corresponding":[211],"decoding":[212],"method":[213],"well":[215],"novel":[217],"crossover":[218],"and":[219,249,270],"mutation":[220],"operators.":[221],"Those":[222],"evolutionary":[223],"operators":[224],"always":[225],"produce":[226],"valid":[227],"solutions.":[228],"For":[229],"examining":[230],"efficiency":[232],"MFEA,":[236],"experiments":[237],"wide":[240],"range":[241],"test":[243],"sets":[244],"instances":[246],"were":[247],"implemented":[248],"results":[251],"pointed":[252],"out":[253],"effectiveness":[255],"algorithm.":[259],"Finally,":[260],"characteristics":[262],"indicated":[269],"carefully":[271],"analyzed.":[272]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}