{"id":"https://openalex.org/W2986225358","doi":"https://doi.org/10.1080/08839514.2020.1730629","title":"A Memetic Algorithm Based on Breakout Local Search for the Generalized Traveling Salesman Problem","display_name":"A Memetic Algorithm Based on Breakout Local Search for the Generalized Traveling Salesman Problem","publication_year":2020,"publication_date":"2020-03-02","ids":{"openalex":"https://openalex.org/W2986225358","doi":"https://doi.org/10.1080/08839514.2020.1730629","mag":"2986225358"},"language":"en","primary_location":{"id":"doi:10.1080/08839514.2020.1730629","is_oa":false,"landing_page_url":"https://doi.org/10.1080/08839514.2020.1730629","pdf_url":null,"source":{"id":"https://openalex.org/S125501549","display_name":"Applied Artificial Intelligence","issn_l":"0883-9514","issn":["0883-9514","1087-6545"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Applied Artificial Intelligence","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1911.01966","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Mehdi El Krari","orcid":null},"institutions":[{"id":"https://openalex.org/I126477371","display_name":"Mohammed V University","ror":"https://ror.org/00r8w8f84","country_code":"MA","type":"education","lineage":["https://openalex.org/I126477371"]}],"countries":["MA"],"is_corresponding":true,"raw_author_name":"Mehdi El Krari","raw_affiliation_strings":["Computer Science Laboratory","Faculty of Science, Mohammed V University in Rabat, Rabat, Morocco"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Laboratory","institution_ids":[]},{"raw_affiliation_string":"Faculty of Science, Mohammed V University in Rabat, Rabat, Morocco","institution_ids":["https://openalex.org/I126477371"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Bela\u00efd Ahiod","orcid":null},"institutions":[{"id":"https://openalex.org/I126477371","display_name":"Mohammed V University","ror":"https://ror.org/00r8w8f84","country_code":"MA","type":"education","lineage":["https://openalex.org/I126477371"]},{"id":"https://openalex.org/I4210089144","display_name":"Centre National pour la Recherche Scientifique et Technique (CNRST)","ror":"https://ror.org/00675rp98","country_code":"MA","type":"funder","lineage":["https://openalex.org/I4210089144"]}],"countries":["MA"],"is_corresponding":false,"raw_author_name":"Bela\u00efd Ahiod","raw_affiliation_strings":["Faculty of Science, Mohammed V University in Rabat, Rabat, Morocco","LRIT, Associated Unit to CNRST (URAC 29)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Science, Mohammed V University in Rabat, Rabat, Morocco","institution_ids":["https://openalex.org/I126477371"]},{"raw_affiliation_string":"LRIT, Associated Unit to CNRST (URAC 29)","institution_ids":["https://openalex.org/I4210089144"]}]},{"author_position":"last","author":{"id":null,"display_name":"Bouazza El Benani","orcid":null},"institutions":[{"id":"https://openalex.org/I126477371","display_name":"Mohammed V University","ror":"https://ror.org/00r8w8f84","country_code":"MA","type":"education","lineage":["https://openalex.org/I126477371"]}],"countries":["MA"],"is_corresponding":false,"raw_author_name":"Bouazza El Benani","raw_affiliation_strings":["Computer Science Laboratory","Faculty of Science, Mohammed V University in Rabat, Rabat, Morocco"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Laboratory","institution_ids":[]},{"raw_affiliation_string":"Faculty of Science, Mohammed V University in Rabat, Rabat, Morocco","institution_ids":["https://openalex.org/I126477371"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I126477371"],"apc_list":{"value":2195,"currency":"USD","value_usd":2195},"apc_paid":null,"fwci":0.3612,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.66286655,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"34","issue":"7","first_page":"537","last_page":"549"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9089000225067139,"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.9089000225067139,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.05290000140666962,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.009399999864399433,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/memetic-algorithm","display_name":"Memetic algorithm","score":0.9341999888420105},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7870000004768372},{"id":"https://openalex.org/keywords/breakout","display_name":"Breakout","score":0.779699981212616},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.7166000008583069},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.5943999886512756},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.532800018787384},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.5304999947547913},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.4745999872684479},{"id":"https://openalex.org/keywords/iterated-local-search","display_name":"Iterated local search","score":0.4429999887943268}],"concepts":[{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.9341999888420105},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7870000004768372},{"id":"https://openalex.org/C2778091849","wikidata":"https://www.wikidata.org/wiki/Q4959649","display_name":"Breakout","level":2,"score":0.779699981212616},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7347999811172485},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.7166000008583069},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6674000024795532},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5943999886512756},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.532800018787384},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.5304999947547913},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.4745999872684479},{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.4429999887943268},{"id":"https://openalex.org/C51620047","wikidata":"https://www.wikidata.org/wiki/Q23399","display_name":"Memetics","level":2,"score":0.42480000853538513},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.40700000524520874},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.37610000371932983},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.3544999957084656},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.3544999957084656},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.35109999775886536},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.32739999890327454},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.32170000672340393},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29760000109672546},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.27790001034736633},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.26820001006126404},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.26100000739097595},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.2581999897956848},{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.25600001215934753}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1080/08839514.2020.1730629","is_oa":false,"landing_page_url":"https://doi.org/10.1080/08839514.2020.1730629","pdf_url":null,"source":{"id":"https://openalex.org/S125501549","display_name":"Applied Artificial Intelligence","issn_l":"0883-9514","issn":["0883-9514","1087-6545"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Applied Artificial Intelligence","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1911.01966","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1911.01966","pdf_url":"https://arxiv.org/pdf/1911.01966","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:doaj.org/article:0b2d6a8e036a45e498c666fbf77fe794","is_oa":false,"landing_page_url":"https://doaj.org/article/0b2d6a8e036a45e498c666fbf77fe794","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Applied Artificial Intelligence, Vol 34, Iss 7, Pp 537-549 (2020)","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1911.01966","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1911.01966","pdf_url":"https://arxiv.org/pdf/1911.01966","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1517470327","https://openalex.org/W1972760347","https://openalex.org/W1985225156","https://openalex.org/W2008656089","https://openalex.org/W2018269848","https://openalex.org/W2019741214","https://openalex.org/W2023947722","https://openalex.org/W2032342293","https://openalex.org/W2042214415","https://openalex.org/W2048296377","https://openalex.org/W2059956980","https://openalex.org/W2065862878","https://openalex.org/W2067061580","https://openalex.org/W2083974195","https://openalex.org/W2104670598","https://openalex.org/W2149668241","https://openalex.org/W2150367356","https://openalex.org/W2163428398","https://openalex.org/W2405668439","https://openalex.org/W2614564353","https://openalex.org/W2731349518","https://openalex.org/W4246598646","https://openalex.org/W6684276203"],"related_works":[],"abstract_inverted_index":{"The":[0],"Traveling":[1],"Salesman":[2],"Problem":[3],"(TSP)":[4],"is":[5,15,44,52,92],"one":[6],"of":[7,22,38,41],"the":[8,19,39,42,45,50,60,76,102,107],"most":[9],"popular":[10],"Combinatorial":[11],"Optimization":[12],"Problem.":[13],"It":[14],"well":[16],"solicited":[17],"for":[18,30,87,101],"large":[20],"variety":[21],"applications":[23],"that":[24],"it":[25],"can":[26],"solve,":[27],"but":[28],"also":[29],"its":[31,116],"difficulty":[32],"to":[33,63,83,95,112,114],"find":[34],"optimal":[35],"solutions.":[36],"One":[37],"variants":[40],"TSP":[43,47,51],"Generalized":[46],"(GTSP),":[48],"where":[49],"considered":[53],"as":[54],"a":[55,70],"special":[56],"case":[57],"which":[58],"makes":[59],"GTSP":[61,88,103],"harder":[62],"solve.":[64],"We":[65],"propose":[66],"in":[67],"this":[68],"paper":[69],"new":[71],"memetic":[72,98],"algorithm":[73],"based":[74],"on":[75],"well-known":[77],"Breakout":[78],"Local":[79],"Search":[80],"(BLS)":[81],"metaheuristic":[82],"provide":[84],"good":[85],"solutions":[86],"instances.":[89],"Our":[90],"approach":[91],"competitive":[93],"compared":[94],"other":[96],"recent":[97],"algorithms":[99],"proposed":[100],"and":[104],"gives":[105],"at":[106],"same":[108],"time":[109],"some":[110],"improvements":[111],"BLS":[113],"reduce":[115],"runtime.":[117]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-05-06T08:25:59.206177","created_date":"2019-11-22T00:00:00"}