{"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":"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/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":true,"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"],"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"],"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"],"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"],"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":4,"corresponding_author_ids":["https://openalex.org/A5019237977"],"corresponding_institution_ids":["https://openalex.org/I4210153668"],"apc_list":null,"apc_paid":null,"fwci":0.2965,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.67014986,"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":[{"display_name":"Sustainable cities and communities","score":0.75,"id":"https://metadata.un.org/sdg/11"}],"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,36,88,102],"consider":[1],"in":[2,45,137,165],"this":[3],"work":[4],"the":[5,15,19,28,38,47,60,75,81,108,142,147,150,162],"<tex":[6,98],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[7,99],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$n$</tex>":[8],"-city":[9],"Traveling":[10],"Salesman":[11],"Problem":[12],"(TSP),":[13],"where":[14],"travel":[16,48],"times":[17],"between":[18],"cities":[20,123],"are":[21,53],"non-deterministic.":[22],"Our":[23],"purpose":[24],"is":[25],"to":[26,121,134],"compute":[27],"shortest":[29],"but":[30],"also":[31,103],"most":[32],"reliable":[33],"TSP":[34],"tours.":[35],"formulate":[37],"problem":[39,44],"as":[40],"a":[41,64,70,166],"bi-objective":[42],"optimization":[43],"which":[46],"time":[49],"and":[50,80,146],"its":[51],"variation":[52],"considered":[54],"under":[55],"minimization.":[56],"To":[57],"efficiently":[58],"solve":[59],"problem,":[61],"we":[62],"introduce":[63],"new":[65],"memetic":[66],"algorithm":[67,128,155],"based":[68,96],"on":[69,97],"combination":[71],"of":[72,139,149,169],"two":[73],"meta-heuristics:":[74],"population-based":[76],"Genetic":[77,112],"Algorithm":[78,113],"(GA)":[79],"single":[82],"solution-based":[83],"Variable":[84],"Neighborhood":[85],"Search":[86],"(VNS).":[87],"compare":[89,104],"our":[90,105,127,154],"approach":[91,164],"with":[92,107],"an":[93],"exact":[94,163],"method":[95],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\epsilon$</tex>":[100],"-constraint.":[101],"results":[106],"well-known":[109],"Non-Dominated":[110],"Sorting":[111],"(NSGA2).":[114],"Solving":[115],"real-world":[116],"instances":[117],"ranging":[118],"from":[119],"29":[120],"101":[122],"has":[124],"shown":[125],"that":[126],"provides":[129],"higher":[130],"quality":[131],"solutions":[132,160],"compared":[133],"NSGA2":[135],"both":[136],"terms":[138],"convergence":[140],"toward":[141],"optimal":[143,158],"Pareto":[144],"front":[145],"diversity":[148],"obtained":[151],"solutions.":[152],"Moreover,":[153],"provided":[156],"more":[157],"non-dominated":[159],"than":[161],"shorter":[167],"amount":[168],"computational":[170],"time.":[171]},"counts_by_year":[{"year":2023,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}