{"id":"https://openalex.org/W2887465054","doi":"https://doi.org/10.4149/cai_2018_3_656","title":"Breakout Local Search for the Travelling Salesman Problem","display_name":"Breakout Local Search for the Travelling Salesman Problem","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2887465054","doi":"https://doi.org/10.4149/cai_2018_3_656","mag":"2887465054"},"language":"en","primary_location":{"id":"doi:10.4149/cai_2018_3_656","is_oa":true,"landing_page_url":"https://doi.org/10.4149/cai_2018_3_656","pdf_url":null,"source":{"id":"https://openalex.org/S4210200093","display_name":"Computing and Informatics","issn_l":"1335-9150","issn":["1335-9150","2585-8807"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"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":true,"oa_status":"diamond","oa_url":"https://doi.org/10.4149/cai_2018_3_656","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5084201218","display_name":"Mehdi El Krari","orcid":"https://orcid.org/0000-0001-7936-9430"},"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"],"affiliations":[{"raw_affiliation_string":"Computer Science Laboratory, Faculty of Science, Mohammed V University in Rabat","institution_ids":["https://openalex.org/I126477371"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081271044","display_name":"Bela\u00efd Ahiod","orcid":"https://orcid.org/0009-0005-4499-4259"},"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":"Belaid Ahiod","raw_affiliation_strings":["Faculty of Science, Mohammed V University in Rabat, LRIT, Associated Unit to CNRST (URAC 29), Rabat"],"affiliations":[{"raw_affiliation_string":"Faculty of Science, Mohammed V University in Rabat, LRIT, Associated Unit to CNRST (URAC 29), Rabat","institution_ids":["https://openalex.org/I126477371"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044261019","display_name":"Bouazza Elbenani","orcid":"https://orcid.org/0000-0002-1655-672X"},"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"],"affiliations":[{"raw_affiliation_string":"Computer Science Laboratory, Faculty of Science, Mohammed V University in Rabat","institution_ids":["https://openalex.org/I126477371"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5084201218"],"corresponding_institution_ids":["https://openalex.org/I126477371"],"apc_list":null,"apc_paid":null,"fwci":0.1629,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.58326554,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"37","issue":"3","first_page":"656","last_page":"672"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9993000030517578,"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.9993000030517578,"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.998199999332428,"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/T11106","display_name":"Data Management and Algorithms","score":0.9828000068664551,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/tabu-search","display_name":"Tabu search","score":0.8928951025009155},{"id":"https://openalex.org/keywords/iterated-local-search","display_name":"Iterated local search","score":0.8460065722465515},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.8060270547866821},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.673487663269043},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6689184904098511},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.6547953486442566},{"id":"https://openalex.org/keywords/guided-local-search","display_name":"Guided Local Search","score":0.6297934651374817},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5619797706604004},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.5383738875389099},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5373700261116028},{"id":"https://openalex.org/keywords/breakout","display_name":"Breakout","score":0.5017776489257812},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.4979865550994873},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.48777061700820923},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4476121664047241},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4153992533683777},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.41090357303619385}],"concepts":[{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.8928951025009155},{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.8460065722465515},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.8060270547866821},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.673487663269043},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6689184904098511},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.6547953486442566},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.6297934651374817},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5619797706604004},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.5383738875389099},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5373700261116028},{"id":"https://openalex.org/C2778091849","wikidata":"https://www.wikidata.org/wiki/Q4959649","display_name":"Breakout","level":2,"score":0.5017776489257812},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.4979865550994873},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.48777061700820923},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4476121664047241},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4153992533683777},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.41090357303619385},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"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/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4149/cai_2018_3_656","is_oa":true,"landing_page_url":"https://doi.org/10.4149/cai_2018_3_656","pdf_url":null,"source":{"id":"https://openalex.org/S4210200093","display_name":"Computing and Informatics","issn_l":"1335-9150","issn":["1335-9150","2585-8807"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"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":{"id":"doi:10.4149/cai_2018_3_656","is_oa":true,"landing_page_url":"https://doi.org/10.4149/cai_2018_3_656","pdf_url":null,"source":{"id":"https://openalex.org/S4210200093","display_name":"Computing and Informatics","issn_l":"1335-9150","issn":["1335-9150","2585-8807"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"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"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.75}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W72149963","https://openalex.org/W656060844","https://openalex.org/W1575155528","https://openalex.org/W1717440967","https://openalex.org/W2002425996","https://openalex.org/W2010334716","https://openalex.org/W2016851559","https://openalex.org/W2032342293","https://openalex.org/W2060322444","https://openalex.org/W2073826583","https://openalex.org/W2104670598","https://openalex.org/W2106378689","https://openalex.org/W2163428398","https://openalex.org/W2324108981"],"related_works":["https://openalex.org/W2083844986","https://openalex.org/W2168643276","https://openalex.org/W1996453501","https://openalex.org/W2887485518","https://openalex.org/W2560221187","https://openalex.org/W3038892751","https://openalex.org/W2123829500","https://openalex.org/W1655912143","https://openalex.org/W2305572622","https://openalex.org/W2535266198"],"abstract_inverted_index":{"The":[0,128],"travelling":[1],"salesman":[2],"problem":[3,10],"(TSP),":[4],"a":[5,15,35,83,87],"famous":[6],"NP-hard":[7],"combinatorial":[8],"optimisation":[9],"(COP),":[11],"consists":[12],"of":[13,37,66,86,131,137],"finding":[14],"minimum":[16],"length":[17],"tour":[18],"that":[19],"visits":[20],"n":[21],"cities":[22],"exactly":[23],"once":[24],"and":[25,58,75,97,110],"comes":[26],"back":[27],"to":[28,89,107,142],"the":[29,38,41,52,122,135,138],"starting":[30],"city.":[31],"This":[32,114],"paper":[33],"presents":[34],"resolution":[36],"TSP":[39],"using":[40],"breakout":[42],"local":[43,54,84,147],"search":[44,55,73,78],"metaheuristic":[45],"algorithm":[46,140],"(BLS),":[47],"which":[48],"is":[49],"based":[50,145],"on":[51,146],"iterated":[53],"(ILS)":[56],"framework":[57],"improves":[59],"it":[60],"by":[61,91],"introducing":[62],"some":[63],"fundamental":[64],"features":[65],"several":[67],"well-established":[68],"metaheuristics":[69],"such":[70],"as":[71],"tabu":[72],"(TS)":[74],"variable":[76],"neighbourhood":[77,88],"(VNS).":[79],"BLS":[80],"moves":[81],"from":[82,121],"optimum":[85],"another":[90],"applying":[92],"perturbation":[93],"jumps":[94],"whose":[95],"type":[96],"number":[98],"are":[99],"determined":[100],"adaptively.":[101],"It":[102],"has":[103],"already":[104],"been":[105],"applied":[106],"many":[108],"COP":[109],"gives":[111],"good":[112],"results.":[113],"innovative":[115],"hybridisation":[116],"resolved":[117],"well":[118],"41":[119],"instances":[120],"commonly":[123],"used":[124],"benchmark":[125],"library":[126],"TSPLIB.":[127],"high":[129],"quality":[130],"experimental":[132],"results":[133],"shows":[134],"competitiveness":[136],"proposed":[139],"compared":[141],"other":[143],"algorithms":[144],"search.":[148]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}