{"id":"https://openalex.org/W1589034382","doi":"https://doi.org/10.1090/dimacs/057/03","title":"Guided local search joins the elite in discrete optimisation","display_name":"Guided local search joins the elite in discrete optimisation","publication_year":2001,"publication_date":"2001-02-27","ids":{"openalex":"https://openalex.org/W1589034382","doi":"https://doi.org/10.1090/dimacs/057/03","mag":"1589034382"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/057/03","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/057/03","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5111563427","display_name":"Christos Voudouris","orcid":null},"institutions":[{"id":"https://openalex.org/I1332878012","display_name":"BT Group (United Kingdom)","ror":"https://ror.org/00kv9pj15","country_code":"GB","type":"company","lineage":["https://openalex.org/I1332878012"]},{"id":"https://openalex.org/I161057412","display_name":"University of New Hampshire","ror":"https://ror.org/01rmh9n78","country_code":"US","type":"education","lineage":["https://openalex.org/I161057412"]}],"countries":["GB","US"],"is_corresponding":false,"raw_author_name":"Christos Voudouris","raw_affiliation_strings":["University of New Hampshire, Durham, NH","Intelligent Systems Research Group, Advanced Research & Technology Dept. BT Laboratories, British Telecommunications plc. United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of New Hampshire, Durham, NH","institution_ids":["https://openalex.org/I161057412"]},{"raw_affiliation_string":"Intelligent Systems Research Group, Advanced Research & Technology Dept. BT Laboratories, British Telecommunications plc. United Kingdom","institution_ids":["https://openalex.org/I1332878012"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089959591","display_name":"Edward Tsang","orcid":"https://orcid.org/0000-0002-8380-3209"},"institutions":[{"id":"https://openalex.org/I110002522","display_name":"University of Essex","ror":"https://ror.org/02nkf1q06","country_code":"GB","type":"education","lineage":["https://openalex.org/I110002522"]},{"id":"https://openalex.org/I161057412","display_name":"University of New Hampshire","ror":"https://ror.org/01rmh9n78","country_code":"US","type":"education","lineage":["https://openalex.org/I161057412"]}],"countries":["GB","US"],"is_corresponding":true,"raw_author_name":"Edward Tsang","raw_affiliation_strings":["University of New Hampshire, Durham, NH","Department of Computer Science, University of Essex United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of New Hampshire, Durham, NH","institution_ids":["https://openalex.org/I161057412"]},{"raw_affiliation_string":"Department of Computer Science, University of Essex United Kingdom","institution_ids":["https://openalex.org/I110002522"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5089959591"],"corresponding_institution_ids":["https://openalex.org/I110002522","https://openalex.org/I161057412"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.16166078,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"29","last_page":"39"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.994700014591217,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9943000078201294,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/iterated-local-search","display_name":"Iterated local search","score":0.7411442995071411},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.7283235788345337},{"id":"https://openalex.org/keywords/guided-local-search","display_name":"Guided Local Search","score":0.657238781452179},{"id":"https://openalex.org/keywords/joins","display_name":"Joins","score":0.6277921199798584},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5757832527160645},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.5023999214172363},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4993002414703369},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.47401008009910583},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.4597187042236328},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4398782253265381},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.41625869274139404},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4122948944568634},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30905628204345703},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.29852473735809326},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.22209635376930237}],"concepts":[{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.7411442995071411},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.7283235788345337},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.657238781452179},{"id":"https://openalex.org/C2778692605","wikidata":"https://www.wikidata.org/wiki/Q4041866","display_name":"Joins","level":2,"score":0.6277921199798584},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5757832527160645},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5023999214172363},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4993002414703369},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.47401008009910583},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.4597187042236328},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4398782253265381},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.41625869274139404},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4122948944568634},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30905628204345703},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.29852473735809326},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.22209635376930237},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1090/dimacs/057/03","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/057/03","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320279","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":60,"referenced_works":["https://openalex.org/W19258104","https://openalex.org/W24800624","https://openalex.org/W36084907","https://openalex.org/W56683784","https://openalex.org/W63621395","https://openalex.org/W64859905","https://openalex.org/W177304403","https://openalex.org/W189367609","https://openalex.org/W202901394","https://openalex.org/W206942027","https://openalex.org/W289732966","https://openalex.org/W1491526799","https://openalex.org/W1497256448","https://openalex.org/W1509226696","https://openalex.org/W1514415888","https://openalex.org/W1515177345","https://openalex.org/W1546457065","https://openalex.org/W1553069021","https://openalex.org/W1589232796","https://openalex.org/W1660751281","https://openalex.org/W1678058668","https://openalex.org/W1988095917","https://openalex.org/W2035855976","https://openalex.org/W2040013655","https://openalex.org/W2042986967","https://openalex.org/W2043193943","https://openalex.org/W2050440701","https://openalex.org/W2054706926","https://openalex.org/W2056229702","https://openalex.org/W2070076796","https://openalex.org/W2072339136","https://openalex.org/W2092993939","https://openalex.org/W2102076751","https://openalex.org/W2104670598","https://openalex.org/W2114712485","https://openalex.org/W2114951958","https://openalex.org/W2128193809","https://openalex.org/W2130309412","https://openalex.org/W2131818603","https://openalex.org/W2132575453","https://openalex.org/W2134461444","https://openalex.org/W2144931885","https://openalex.org/W2151676833","https://openalex.org/W2152150600","https://openalex.org/W2162256560","https://openalex.org/W2165372647","https://openalex.org/W2166166917","https://openalex.org/W2166843422","https://openalex.org/W2180945711","https://openalex.org/W2266946488","https://openalex.org/W2610826712","https://openalex.org/W2753176400","https://openalex.org/W2883159441","https://openalex.org/W2972294554","https://openalex.org/W3023540311","https://openalex.org/W4210498713","https://openalex.org/W4249958171","https://openalex.org/W4255250986","https://openalex.org/W4285719527","https://openalex.org/W4291236916"],"related_works":["https://openalex.org/W2091348864","https://openalex.org/W2569549435","https://openalex.org/W2784687883","https://openalex.org/W3014398131","https://openalex.org/W1524973174","https://openalex.org/W2354343466","https://openalex.org/W2997121997","https://openalex.org/W1537780499","https://openalex.org/W2576785097","https://openalex.org/W2099229656"],"abstract_inverted_index":{"Developed":[0],"from":[1],"constraint":[2,24],"satisfaction":[3,25],"as":[4,6,125],"well":[5],"operations":[7,63],"research":[8,64],"ideas,":[9],"Guided":[10],"Local":[11,16],"Search":[12,17],"(GLS)":[13],"and":[14,26,77,89,101,104,142],"Fast":[15],"are":[18,75],"novel":[19],"meta-heuristic":[20],"search":[21],"methods":[22],"for":[23],"optimisation.GLS":[27],"sits":[28],"on":[29],"top":[30],"of":[31,37,82,86,99,108,145],"other":[32],"local-search":[33],"algorithms.The":[34],"basic":[35],"principle":[36],"GLS":[38,68],"is":[39,58,69,79,113],"to":[40,95],"penalise":[41],"features":[42,74],"exhibited":[43],"by":[44],"the":[45,71,84,87,115,132],"candidate":[46],"solution":[47],"when":[48],"a":[49,54,80,96],"localsearch":[50],"algorithm":[51],"settles":[52],"in":[53,62,67,70,114,120],"local":[55],"optimum.Using":[56],"penalties":[57],"an":[59],"idea":[60],"used":[61],"before.The":[65],"novelty":[66],"way":[72,81],"that":[73],"selected":[76],"penalised.FLS":[78],"reducing":[83],"size":[85],"neighbourhood.GLS":[88],"FLS":[90],"together":[91],"have":[92],"been":[93],"applied":[94],"non-trivial":[97],"number":[98],"satisfiability":[100],"optimisation":[102,148],"problems":[103],"achieved":[105],"remarkable":[106],"result.One":[107],"their":[109,146],"most":[110],"outstanding":[111],"achievements":[112],"well-studied":[116],"travelling":[117],"salesman":[118],"problem,":[119],"which":[121],"they":[122],"obtained":[123],"results":[124],"good":[126],"as,":[127],"if":[128],"not":[129],"better":[130],"than":[131],"state-of-the-art":[133],"algorithms.In":[134],"this":[135],"paper,":[136],"we":[137],"shall":[138],"outline":[139],"these":[140],"algorithms":[141],"describe":[143],"some":[144],"discrete":[147],"applications.":[149]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-07T06:01:17.266235","created_date":"2025-10-10T00:00:00"}