{"id":"https://openalex.org/W2142450255","doi":"https://doi.org/10.1017/s0269888901000078","title":"Combining local and global search in a constraint programming environment","display_name":"Combining local and global search in a constraint programming environment","publication_year":2001,"publication_date":"2001-03-01","ids":{"openalex":"https://openalex.org/W2142450255","doi":"https://doi.org/10.1017/s0269888901000078","mag":"2142450255"},"language":"en","primary_location":{"id":"doi:10.1017/s0269888901000078","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0269888901000078","pdf_url":null,"source":{"id":"https://openalex.org/S137506714","display_name":"The Knowledge Engineering Review","issn_l":"0269-8889","issn":["0269-8889","1469-8005"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Knowledge Engineering Review","raw_type":"journal-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/A5022238257","display_name":"Yves Caseau","orcid":null},"institutions":[{"id":"https://openalex.org/I280199911","display_name":"Bouygues (France)","ror":"https://ror.org/056185y51","country_code":"FR","type":"company","lineage":["https://openalex.org/I280199911"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"YVES CASEAU","raw_affiliation_strings":["Bouygues SA, DTN, 1, avenue Eug\u00e8ne Freyssinet,F-78061 Saint Quentin-en-Yvelines, France{ycs,flaburth,brottemb}@challenger.bouygues.fr","Bouygues SA, DTN, 1, avenue Eug\u00e8ne Freyssinet,F-78061 Saint Quentin-en-Yvelines, France {ycs,flaburth,brottemb}@challenger.bouygues.fr"],"affiliations":[{"raw_affiliation_string":"Bouygues SA, DTN, 1, avenue Eug\u00e8ne Freyssinet,F-78061 Saint Quentin-en-Yvelines, France{ycs,flaburth,brottemb}@challenger.bouygues.fr","institution_ids":[]},{"raw_affiliation_string":"Bouygues SA, DTN, 1, avenue Eug\u00e8ne Freyssinet,F-78061 Saint Quentin-en-Yvelines, France {ycs,flaburth,brottemb}@challenger.bouygues.fr","institution_ids":["https://openalex.org/I280199911"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087357506","display_name":"Fran\u00e7ois Laburthe","orcid":null},"institutions":[{"id":"https://openalex.org/I280199911","display_name":"Bouygues (France)","ror":"https://ror.org/056185y51","country_code":"FR","type":"company","lineage":["https://openalex.org/I280199911"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"FRAN\u00c7OIS LABURTHE","raw_affiliation_strings":["Bouygues SA, DTN, 1, avenue Eug\u00e8ne Freyssinet,F-78061 Saint Quentin-en-Yvelines, France{ycs,flaburth,brottemb}@challenger.bouygues.fr","Bouygues SA, DTN, 1, avenue Eug\u00e8ne Freyssinet,F-78061 Saint Quentin-en-Yvelines, France {ycs,flaburth,brottemb}@challenger.bouygues.fr"],"affiliations":[{"raw_affiliation_string":"Bouygues SA, DTN, 1, avenue Eug\u00e8ne Freyssinet,F-78061 Saint Quentin-en-Yvelines, France{ycs,flaburth,brottemb}@challenger.bouygues.fr","institution_ids":[]},{"raw_affiliation_string":"Bouygues SA, DTN, 1, avenue Eug\u00e8ne Freyssinet,F-78061 Saint Quentin-en-Yvelines, France {ycs,flaburth,brottemb}@challenger.bouygues.fr","institution_ids":["https://openalex.org/I280199911"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057318656","display_name":"Claude Le Pape","orcid":null},"institutions":[{"id":"https://openalex.org/I280199911","display_name":"Bouygues (France)","ror":"https://ror.org/056185y51","country_code":"FR","type":"company","lineage":["https://openalex.org/I280199911"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"CLAUDE LE PAPE","raw_affiliation_strings":["Bouygues Telecom, R&D, 51, avenue de l'Europe, F-78944 V\u00e9lizy","Bouygues Telecom, R&D, 51, avenue de l'Europe, F-78944 V\u00e9\u00e9lizy, France clepapeg@bouyguestelecom.fr#TAB#"],"affiliations":[{"raw_affiliation_string":"Bouygues Telecom, R&D, 51, avenue de l'Europe, F-78944 V\u00e9lizy","institution_ids":["https://openalex.org/I280199911"]},{"raw_affiliation_string":"Bouygues Telecom, R&D, 51, avenue de l'Europe, F-78944 V\u00e9\u00e9lizy, France clepapeg@bouyguestelecom.fr#TAB#","institution_ids":["https://openalex.org/I280199911"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113871337","display_name":"Beno\u00eet Rottembourg","orcid":null},"institutions":[{"id":"https://openalex.org/I280199911","display_name":"Bouygues (France)","ror":"https://ror.org/056185y51","country_code":"FR","type":"company","lineage":["https://openalex.org/I280199911"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"BENO\u00ceT ROTTEMBOURG","raw_affiliation_strings":["Bouygues SA, DTN, 1, avenue Eug\u00e8ne Freyssinet,F-78061 Saint Quentin-en-Yvelines, France{ycs,flaburth,brottemb}@challenger.bouygues.fr","Bouygues SA, DTN, 1, avenue Eug\u00e8ne Freyssinet,F-78061 Saint Quentin-en-Yvelines, France {ycs,flaburth,brottemb}@challenger.bouygues.fr"],"affiliations":[{"raw_affiliation_string":"Bouygues SA, DTN, 1, avenue Eug\u00e8ne Freyssinet,F-78061 Saint Quentin-en-Yvelines, France{ycs,flaburth,brottemb}@challenger.bouygues.fr","institution_ids":[]},{"raw_affiliation_string":"Bouygues SA, DTN, 1, avenue Eug\u00e8ne Freyssinet,F-78061 Saint Quentin-en-Yvelines, France {ycs,flaburth,brottemb}@challenger.bouygues.fr","institution_ids":["https://openalex.org/I280199911"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5022238257"],"corresponding_institution_ids":["https://openalex.org/I280199911"],"apc_list":null,"apc_paid":null,"fwci":3.5055,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.92168099,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"16","issue":"1","first_page":"41","last_page":"68"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9991000294685364,"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.9991000294685364,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9980999827384949,"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.9945999979972839,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.6677111387252808},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6612231731414795},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6339453458786011},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.5915402770042419},{"id":"https://openalex.org/keywords/guided-local-search","display_name":"Guided Local Search","score":0.5418323874473572},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.5192901492118835},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49197933077812195},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.47007328271865845},{"id":"https://openalex.org/keywords/iterated-local-search","display_name":"Iterated local search","score":0.44081902503967285},{"id":"https://openalex.org/keywords/hill-climbing","display_name":"Hill climbing","score":0.43989938497543335},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.42301222681999207},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.42192673683166504},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.31860339641571045},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.27224841713905334},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.154814213514328},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.14673644304275513},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.09564435482025146}],"concepts":[{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.6677111387252808},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6612231731414795},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6339453458786011},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.5915402770042419},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.5418323874473572},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.5192901492118835},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49197933077812195},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.47007328271865845},{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.44081902503967285},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.43989938497543335},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.42301222681999207},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.42192673683166504},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.31860339641571045},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.27224841713905334},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.154814213514328},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.14673644304275513},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.09564435482025146},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0269888901000078","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0269888901000078","pdf_url":null,"source":{"id":"https://openalex.org/S137506714","display_name":"The Knowledge Engineering Review","issn_l":"0269-8889","issn":["0269-8889","1469-8005"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Knowledge Engineering Review","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.5699999928474426}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W10678874","https://openalex.org/W53596869","https://openalex.org/W60640492","https://openalex.org/W69287022","https://openalex.org/W91781137","https://openalex.org/W109225361","https://openalex.org/W1534773087","https://openalex.org/W1540699063","https://openalex.org/W1554727768","https://openalex.org/W1555523867","https://openalex.org/W1583233220","https://openalex.org/W1589190585","https://openalex.org/W1606316903","https://openalex.org/W1822524951","https://openalex.org/W1843459482","https://openalex.org/W1937463903","https://openalex.org/W1971338172","https://openalex.org/W2006389447","https://openalex.org/W2011039300","https://openalex.org/W2020459421","https://openalex.org/W2029681015","https://openalex.org/W2042986967","https://openalex.org/W2071306171","https://openalex.org/W2081278763","https://openalex.org/W2088304441","https://openalex.org/W2090619991","https://openalex.org/W2096200006","https://openalex.org/W2096305430","https://openalex.org/W2096620062","https://openalex.org/W2108536179","https://openalex.org/W2109405343","https://openalex.org/W2113198352","https://openalex.org/W2120855292","https://openalex.org/W2126207702","https://openalex.org/W2130272456","https://openalex.org/W2131680530","https://openalex.org/W2135644739","https://openalex.org/W2162508334","https://openalex.org/W2165387188","https://openalex.org/W2177173668","https://openalex.org/W2581758795","https://openalex.org/W3021654671"],"related_works":["https://openalex.org/W4237368524","https://openalex.org/W2123829500","https://openalex.org/W4252370918","https://openalex.org/W2045456468","https://openalex.org/W4247343174","https://openalex.org/W90886653","https://openalex.org/W1548986920","https://openalex.org/W2168643831","https://openalex.org/W1533229056","https://openalex.org/W1537780499"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"several":[3],"case":[4],"studies":[5],"which":[6],"illustrate":[7],"how":[8,95,122],"constraint":[9],"programming":[10],"can":[11,99,131],"benefit":[12],"from":[13],"the":[14,29,56,102,142,146],"combination":[15],"of":[16,31,58,104,137,145],"global":[17,47,110],"and":[18,25,71,109,128,135],"local":[19,42,108],"search":[20,43,48,67,111],"techniques,":[21],"offering":[22],"a":[23,52,113,124],"flexible":[24],"efficient":[26],"platform":[27],"for":[28,126],"design":[30,103],"combinatorial":[32],"optimisation":[33],"applications.":[34],"For":[35,61,77],"job-shop":[36,63],"scheduling,":[37,64],"we":[38,80,93],"relate":[39],"experiments":[40],"with":[41,88],"procedures":[44],"that":[45],"use":[46],"to":[49,141],"intensively":[50],"explore":[51],"given":[53],"neighbourhood,":[54],"in":[55],"spirit":[57],"\u201cshuffle\u201d":[59],"methods.":[60],"preemptive":[62],"two":[65],"basic":[66],"strategies,":[68],"Depth-First":[69],"Search":[70],"Limited":[72,89],"Discrepancy":[73,90],"Search,":[74],"are":[75],"compared.":[76],"Vehicle":[78],"Routing":[79],"report":[81],"an":[82],"Incremental":[83],"Local":[84],"Optimisation":[85],"heuristic,":[86],"combined":[87],"Search.":[91],"Finally,":[92],"show":[94],"ad":[96],"hoc":[97],"algebras":[98],"considerably":[100],"enhance":[101],"heuristics":[105],"based":[106],"on":[107,117],"within":[112],"constraint-programming":[114],"environment.":[115],"Experiments":[116],"vehicle":[118],"routing":[119],"will":[120],"enlighten":[121],"such":[123],"language":[125],"\u201csearch":[127],"insert\u201d":[129],"control":[130],"enable":[132],"automated":[133],"tuning":[134],"discovery":[136],"new":[138],"strategies":[139],"adapted":[140],"instances":[143],"typology":[144],"problem":[147],"at":[148],"stake.":[149]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-01-08T20:05:33.558190","created_date":"2025-10-10T00:00:00"}