{"id":"https://openalex.org/W2128203640","doi":"https://doi.org/10.1109/tai.2002.1180836","title":"Local search algorithm to improve the local search","display_name":"Local search algorithm to improve the local search","publication_year":2003,"publication_date":"2003-06-26","ids":{"openalex":"https://openalex.org/W2128203640","doi":"https://doi.org/10.1109/tai.2002.1180836","mag":"2128203640"},"language":"en","primary_location":{"id":"doi:10.1109/tai.2002.1180836","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tai.2002.1180836","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings.","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/A5014244564","display_name":"Mohamed Tounsi","orcid":"https://orcid.org/0000-0002-8883-6106"},"institutions":[{"id":"https://openalex.org/I70768539","display_name":"\u00c9cole Nationale Sup\u00e9rieure des Mines de Paris","ror":"https://ror.org/04y8cs423","country_code":"FR","type":"education","lineage":["https://openalex.org/I190752583","https://openalex.org/I2746051580","https://openalex.org/I70768539"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"M. Tounsi","raw_affiliation_strings":["Computer Science Department, Ecole des Mines de Nantes, France","Comput. Sci. Dept., Ecole des Mines de Nantes, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Ecole des Mines de Nantes, France","institution_ids":["https://openalex.org/I70768539"]},{"raw_affiliation_string":"Comput. Sci. Dept., Ecole des Mines de Nantes, France","institution_ids":["https://openalex.org/I70768539"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102311932","display_name":"Pamela David","orcid":null},"institutions":[{"id":"https://openalex.org/I70768539","display_name":"\u00c9cole Nationale Sup\u00e9rieure des Mines de Paris","ror":"https://ror.org/04y8cs423","country_code":"FR","type":"education","lineage":["https://openalex.org/I190752583","https://openalex.org/I2746051580","https://openalex.org/I70768539"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"P. David","raw_affiliation_strings":["Computer Science Department, Ecole des Mines de Nantes, France","Comput. Sci. Dept., Ecole des Mines de Nantes, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Ecole des Mines de Nantes, France","institution_ids":["https://openalex.org/I70768539"]},{"raw_affiliation_string":"Comput. Sci. Dept., Ecole des Mines de Nantes, France","institution_ids":["https://openalex.org/I70768539"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I70768539"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.21938705,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"220","issue":null,"first_page":"438","last_page":"443"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998000264167786,"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.9998000264167786,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9925000071525574,"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/guided-local-search","display_name":"Guided Local Search","score":0.8979688882827759},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.8476848602294922},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6119879484176636},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.5763177275657654},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5538403987884521},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.5442086458206177},{"id":"https://openalex.org/keywords/best-first-search","display_name":"Best-first search","score":0.5425969958305359},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.5388820171356201},{"id":"https://openalex.org/keywords/iterated-local-search","display_name":"Iterated local search","score":0.5076919794082642},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4925866723060608},{"id":"https://openalex.org/keywords/hill-climbing","display_name":"Hill climbing","score":0.4802013635635376},{"id":"https://openalex.org/keywords/beam-stack-search","display_name":"Beam stack search","score":0.460789293050766},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4390184283256531},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.41691744327545166},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.4165405035018921},{"id":"https://openalex.org/keywords/bidirectional-search","display_name":"Bidirectional search","score":0.41134941577911377},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24383267760276794},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20435971021652222}],"concepts":[{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.8979688882827759},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.8476848602294922},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6119879484176636},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.5763177275657654},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5538403987884521},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.5442086458206177},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.5425969958305359},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5388820171356201},{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.5076919794082642},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4925866723060608},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.4802013635635376},{"id":"https://openalex.org/C194036150","wikidata":"https://www.wikidata.org/wiki/Q4876196","display_name":"Beam stack search","level":5,"score":0.460789293050766},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4390184283256531},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.41691744327545166},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.4165405035018921},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.41134941577911377},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24383267760276794},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20435971021652222},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tai.2002.1180836","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tai.2002.1180836","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1495369628","https://openalex.org/W1497256448","https://openalex.org/W1546917456","https://openalex.org/W1559215823","https://openalex.org/W1667614912","https://openalex.org/W1935346671","https://openalex.org/W1994732170","https://openalex.org/W2024060531","https://openalex.org/W2032431794","https://openalex.org/W2042986967","https://openalex.org/W2053913299","https://openalex.org/W2069323107","https://openalex.org/W2090275183","https://openalex.org/W2121766240","https://openalex.org/W2164855953","https://openalex.org/W2166192636","https://openalex.org/W2997776631","https://openalex.org/W6629610141","https://openalex.org/W6633255691","https://openalex.org/W7008583937","https://openalex.org/W7042940515"],"related_works":["https://openalex.org/W2376570066","https://openalex.org/W3180740316","https://openalex.org/W4200104947","https://openalex.org/W58921990","https://openalex.org/W2354057059","https://openalex.org/W4214503203","https://openalex.org/W2125033394","https://openalex.org/W2391773788","https://openalex.org/W4252703652","https://openalex.org/W2540870307"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,51],"present":[4,86],"a":[5,36,45,60,81],"new":[6],"cooperative":[7],"framework":[8],"based":[9,27],"on":[10,28,47],"using":[11,44],"successively":[12],"two":[13],"local":[14,32,61,90,112,123,129],"search":[15,33,41,91,99,113,124],"algorithms":[16,34],"to":[17,38,57,96,102,118,126],"solve":[18,103],"constraint":[19,82],"satisfaction":[20,83],"and":[21],"optimization":[22],"problems.":[23,107],"Our":[24],"technique":[25,64],"is":[26,70],"the":[29,40,54,66,74,87,89,98,111],"integration":[30],"of":[31,43],"as":[35,80],"mechanism":[37],"diversify":[39,97],"instead":[42],"build":[46],"diversification":[48],"mechanisms.":[49],"Thus":[50],"avoid":[52],"tuning":[53],"multiple":[55],"parameters":[56],"escape":[58,127],"from":[59,128],"optimum.":[62],"This":[63],"improves":[65],"existing":[67],"methods:":[68],"it":[69],"generic":[71],"especially":[72],"when":[73],"given":[75],"problem":[76],"can":[77,93,115],"be":[78,94,116],"expressed":[79],"problem.":[84],"We":[85,108],"way":[88],"algorithm":[92,114,125],"used":[95,117],"in":[100],"order":[101],"real":[104],"examination":[105],"timetabling":[106],"describe":[109],"how":[110],"assist":[119],"any":[120],"other":[121],"specific":[122],"optimality.":[130]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}