{"id":"https://openalex.org/W4214714889","doi":"https://doi.org/10.31577/cai_2021_6_1370","title":"Multifactorial Evolutionary Algorithm for Simultaneous Solution of TSP and TRP","display_name":"Multifactorial Evolutionary Algorithm for Simultaneous Solution of TSP and TRP","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W4214714889","doi":"https://doi.org/10.31577/cai_2021_6_1370"},"language":"en","primary_location":{"id":"doi:10.31577/cai_2021_6_1370","is_oa":false,"landing_page_url":"https://doi.org/10.31577/cai_2021_6_1370","pdf_url":null,"source":{"id":"https://openalex.org/S6236348","display_name":"Computing and Informatics / Computers and Artificial Intelligence","issn_l":"1335-9150","issn":["1335-9150","2585-8807"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4360969452","host_organization_name":"Institute of Informatics","host_organization_lineage":["https://openalex.org/P4360969452"],"host_organization_lineage_names":["Institute of Informatics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computing and Informatics","raw_type":"journal-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/A5037843488","display_name":"Ha-Bang Ban","orcid":"https://orcid.org/0000-0003-2241-5146"},"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":"Ha-Bang Ban","raw_affiliation_strings":["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, Hanoi, Vietnam","institution_ids":["https://openalex.org/I94518387"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082192728","display_name":"Dang-Hai Pham","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":"Dang-Hai Pham","raw_affiliation_strings":["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, 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":1.822,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.87953554,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":99},"biblio":{"volume":"40","issue":"6","first_page":"1370","last_page":"1397"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9940000176429749,"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.9940000176429749,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.988099992275238,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9093000292778015,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7725244760513306},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.666595995426178},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.646581768989563},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5453374981880188},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5403298735618591},{"id":"https://openalex.org/keywords/realm","display_name":"Realm","score":0.4411359429359436},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2578689157962799},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22274309396743774}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7725244760513306},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.666595995426178},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.646581768989563},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5453374981880188},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5403298735618591},{"id":"https://openalex.org/C2778757428","wikidata":"https://www.wikidata.org/wiki/Q1250464","display_name":"Realm","level":2,"score":0.4411359429359436},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2578689157962799},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22274309396743774},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","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.31577/cai_2021_6_1370","is_oa":false,"landing_page_url":"https://doi.org/10.31577/cai_2021_6_1370","pdf_url":null,"source":{"id":"https://openalex.org/S6236348","display_name":"Computing and Informatics / Computers and Artificial Intelligence","issn_l":"1335-9150","issn":["1335-9150","2585-8807"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4360969452","host_organization_name":"Institute of Informatics","host_organization_lineage":["https://openalex.org/P4360969452"],"host_organization_lineage_names":["Institute of Informatics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computing and Informatics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4099999964237213,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2359053655","https://openalex.org/W2387777532","https://openalex.org/W2382709029","https://openalex.org/W2389147080","https://openalex.org/W2377883125","https://openalex.org/W2362479786","https://openalex.org/W2392455911","https://openalex.org/W2495211334","https://openalex.org/W2384897607","https://openalex.org/W2887328214"],"abstract_inverted_index":{"We":[0],"study":[1],"two":[2,71,137,143],"problems":[3,138],"called":[4],"the":[5,20,34,39,49,56,61,113,121,131,146,150,154,158,163,166,173,176,193],"Traveling":[6,11],"Repairman":[7],"Problem":[8,13],"(TRP)":[9],"and":[10,153],"Salesman":[12],"(TSP).":[14],"The":[15,103,140],"TRP":[16,50,151],"wants":[17],"to":[18,28,37,42,78,97,108,134],"minimize":[19,38],"total":[21,40],"time":[22,41],"for":[23,70,170,183],"all":[24,44],"customers":[25],"that":[26,67],"have":[27],"wait":[29],"before":[30],"being":[31],"served,":[32],"while":[33],"TSP":[35,57],"aims":[36],"visit":[43],"customers.":[45],"In":[46,60],"this":[47],"sense,":[48],"takes":[51],"a":[52,90,127],"customer-oriented":[53],"view,":[54],"whereas":[55],"is":[58,148,156],"server-oriented.":[59],"literature,":[62],"there":[63],"exist":[64],"numerous":[65],"algorithms":[66,75],"are":[68,76,188],"developed":[69],"problems.":[72],"However,":[73],"these":[74,136],"designed":[77],"solve":[79,98,135],"each":[80],"problem":[81],"independently.":[82],"Recently,":[83],"Multifactorial":[84],"Evolutionary":[85,93],"Algorithm":[86,94],"(MFEA)":[87],"has":[88,106,115,142],"been":[89],"variant":[91],"of":[92,165,179,192],"(EA)":[95],"aiming":[96],"multiple":[99],"optimization":[100],"tasks":[101,144],"simultaneously.":[102,139],"MFEA":[104,132,141,195],"framework":[105,133],"yet":[107],"be":[109],"fully":[110],"exploited,":[111],"but":[112],"realm":[114],"recently":[116],"attracted":[117],"much":[118],"interest":[119],"from":[120],"research":[122],"community.":[123],"This":[124],"paper":[125],"proposed":[126,167],"new":[128],"approach":[129],"using":[130],"simultaneously:":[145],"first":[147],"solving":[149,157],"problem,":[152],"second":[155],"TSP.":[159],"Experiment":[160],"results":[161],"show":[162],"efficiency":[164],"MFEA:":[168],"1.":[169],"small":[171],"instances,":[172,185],"algorithm":[174],"reaches":[175],"optimal":[177],"solutions":[178,187],"both":[180],"problems;":[181],"2.":[182],"large":[184],"our":[186],"better":[189],"than":[190],"those":[191],"previous":[194],"algorithms.":[196]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":10}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}