{"id":"https://openalex.org/W4214843937","doi":"https://doi.org/10.1109/paap54281.2021.9720453","title":"A New Memetic Algorithm to Solve the Stochastic TSP","display_name":"A New Memetic Algorithm to Solve the Stochastic TSP","publication_year":2021,"publication_date":"2021-12-10","ids":{"openalex":"https://openalex.org/W4214843937","doi":"https://doi.org/10.1109/paap54281.2021.9720453"},"language":"en","primary_location":{"id":"doi:10.1109/paap54281.2021.9720453","is_oa":false,"landing_page_url":"https://doi.org/10.1109/paap54281.2021.9720453","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 12th International Symposium on Parallel Architectures, Algorithms and Programming (PAAP)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5019237977","display_name":"Yueting Luo","orcid":null},"institutions":[{"id":"https://openalex.org/I4210153668","display_name":"Wenzhou-Kean University","ror":"https://ror.org/05609xa16","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210153668"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yueting Luo","raw_affiliation_strings":["Wenzhou-Kean University,Department of Computer Science,Wenzhou,China","Department of Computer Science, Wenzhou-Kean University, Wenzhou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Wenzhou-Kean University,Department of Computer Science,Wenzhou,China","institution_ids":["https://openalex.org/I4210153668"]},{"raw_affiliation_string":"Department of Computer Science, Wenzhou-Kean University, Wenzhou, China","institution_ids":["https://openalex.org/I4210153668"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002322637","display_name":"Omar Dib","orcid":"https://orcid.org/0000-0003-1372-0851"},"institutions":[{"id":"https://openalex.org/I4210153668","display_name":"Wenzhou-Kean University","ror":"https://ror.org/05609xa16","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210153668"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Omar Dib","raw_affiliation_strings":["Wenzhou-Kean University,Department of Computer Science,Wenzhou,China","Department of Computer Science, Wenzhou-Kean University, Wenzhou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Wenzhou-Kean University,Department of Computer Science,Wenzhou,China","institution_ids":["https://openalex.org/I4210153668"]},{"raw_affiliation_string":"Department of Computer Science, Wenzhou-Kean University, Wenzhou, China","institution_ids":["https://openalex.org/I4210153668"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034456222","display_name":"Zian Jin","orcid":null},"institutions":[{"id":"https://openalex.org/I4210153668","display_name":"Wenzhou-Kean University","ror":"https://ror.org/05609xa16","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210153668"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jin Zian","raw_affiliation_strings":["Wenzhou-Kean University,Department of Computer Science,Wenzhou,China","Department of Computer Science, Wenzhou-Kean University, Wenzhou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Wenzhou-Kean University,Department of Computer Science,Wenzhou,China","institution_ids":["https://openalex.org/I4210153668"]},{"raw_affiliation_string":"Department of Computer Science, Wenzhou-Kean University, Wenzhou, China","institution_ids":["https://openalex.org/I4210153668"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044688847","display_name":"Hu Bingxu","orcid":null},"institutions":[{"id":"https://openalex.org/I4210153668","display_name":"Wenzhou-Kean University","ror":"https://ror.org/05609xa16","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210153668"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hu Bingxu","raw_affiliation_strings":["Wenzhou-Kean University,Department of Computer Science,Wenzhou,China","Department of Computer Science, Wenzhou-Kean University, Wenzhou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Wenzhou-Kean University,Department of Computer Science,Wenzhou,China","institution_ids":["https://openalex.org/I4210153668"]},{"raw_affiliation_string":"Department of Computer Science, Wenzhou-Kean University, Wenzhou, China","institution_ids":["https://openalex.org/I4210153668"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210153668"],"apc_list":null,"apc_paid":null,"fwci":0.788,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.72418093,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"69","last_page":"75"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994999766349792,"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.9994999766349792,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11942","display_name":"Transportation and Mobility Innovations","score":0.9977999925613403,"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/memetic-algorithm","display_name":"Memetic algorithm","score":0.6815189719200134},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6408900618553162},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6224460601806641},{"id":"https://openalex.org/keywords/variable-neighborhood-search","display_name":"Variable neighborhood search","score":0.558725118637085},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5378624200820923},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.5373256802558899},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5347387194633484},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.5170086622238159},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5150580406188965},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.50504070520401},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4574339985847473},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.44782155752182007},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.4358825385570526},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.40471190214157104},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3864097595214844}],"concepts":[{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.6815189719200134},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6408900618553162},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6224460601806641},{"id":"https://openalex.org/C2776435737","wikidata":"https://www.wikidata.org/wiki/Q7915703","display_name":"Variable neighborhood search","level":3,"score":0.558725118637085},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5378624200820923},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.5373256802558899},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5347387194633484},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.5170086622238159},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5150580406188965},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.50504070520401},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4574339985847473},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.44782155752182007},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4358825385570526},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.40471190214157104},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3864097595214844},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/paap54281.2021.9720453","is_oa":false,"landing_page_url":"https://doi.org/10.1109/paap54281.2021.9720453","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 12th International Symposium on Parallel Architectures, Algorithms and Programming (PAAP)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.75,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1921801318","https://openalex.org/W2030297342","https://openalex.org/W2163510721","https://openalex.org/W2184613088","https://openalex.org/W2560519107","https://openalex.org/W2582812851","https://openalex.org/W2783827472","https://openalex.org/W2884165914","https://openalex.org/W2968009374","https://openalex.org/W2981250586","https://openalex.org/W2996796639","https://openalex.org/W3015457212","https://openalex.org/W4232524738","https://openalex.org/W4246557197","https://openalex.org/W4294360851","https://openalex.org/W6737112841","https://openalex.org/W6766132365"],"related_works":["https://openalex.org/W2163647484","https://openalex.org/W2244079844","https://openalex.org/W47248985","https://openalex.org/W2804769572","https://openalex.org/W2000270779","https://openalex.org/W2129486222","https://openalex.org/W3144175025","https://openalex.org/W2042716007","https://openalex.org/W1778024729","https://openalex.org/W1980841486"],"abstract_inverted_index":{"We":[0,32,84,94],"consider":[1],"in":[2,41,129,157],"this":[3],"work":[4],"the$n$-city":[5],"Traveling":[6],"Salesman":[7],"Problem":[8],"(TSP),":[9],"where":[10],"the":[11,15,24,34,43,56,71,77,100,134,139,142,154],"travel":[12,44],"times":[13],"between":[14],"cities":[16,115],"are":[17,49],"non-deterministic.":[18],"Our":[19],"purpose":[20],"is":[21],"to":[22,113,126],"compute":[23],"shortest":[25],"but":[26],"also":[27,95],"most":[28],"reliable":[29],"TSP":[30],"tours.":[31],"formulate":[33],"problem":[35,40],"as":[36],"a":[37,60,66,158],"bi-objective":[38],"optimization":[39],"which":[42],"time":[45],"and":[46,76,138],"its":[47],"variation":[48],"considered":[50],"under":[51],"minimization.":[52],"To":[53],"efficiently":[54],"solve":[55],"problem,":[57],"we":[58],"introduce":[59],"new":[61],"memetic":[62],"algorithm":[63,120,147],"based":[64,92],"on":[65],"combination":[67],"of":[68,131,141,161],"two":[69],"meta-heuristics:":[70],"population-based":[72],"Genetic":[73,104],"Algorithm":[74,105],"(GA)":[75],"single":[78],"solution-based":[79],"Variable":[80],"Neighborhood":[81],"Search":[82],"(VNS).":[83],"compare":[85,96],"our":[86,97,119,146],"approach":[87,156],"with":[88,99],"an":[89],"exact":[90,155],"method":[91],"on$\\epsilon$-constraint.":[93],"results":[98],"well-known":[101],"Non-Dominated":[102],"Sorting":[103],"(NSGA2).":[106],"Solving":[107],"real-world":[108],"instances":[109],"ranging":[110],"from":[111],"29":[112],"101":[114],"has":[116],"shown":[117],"that":[118],"provides":[121],"higher":[122],"quality":[123],"solutions":[124,152],"compared":[125],"NSGA2":[127],"both":[128],"terms":[130],"convergence":[132],"toward":[133],"optimal":[135,150],"Pareto":[136],"front":[137],"diversity":[140],"obtained":[143],"solutions.":[144],"Moreover,":[145],"provided":[148],"more":[149],"non-dominated":[151],"than":[153],"shorter":[159],"amount":[160],"computational":[162],"time.":[163]},"counts_by_year":[{"year":2023,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}