{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T18:33:04Z","timestamp":1767637984004,"version":"3.48.0"},"reference-count":0,"publisher":"Maximum Academic Press","issue":"1","license":[{"start":{"date-parts":[[2001,8,24]],"date-time":"2001-08-24T00:00:00Z","timestamp":998611200000},"content-version":"unspecified","delay-in-days":176,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Knowledge Engineering Review"],"published-print":{"date-parts":[[2001,3]]},"abstract":"<jats:p>This paper presents several case studies which illustrate how constraint programming can benefit from the combination of global and local search techniques, offering a flexible and efficient platform for the design of combinatorial optimisation applications. For job-shop scheduling, we relate experiments with local search procedures that use \nglobal search to intensively explore a given neighbourhood, in the spirit of \u201cshuffle\u201d methods. For preemptive job-shop scheduling, two basic search strategies, Depth-First Search and Limited Discrepancy Search, are compared. For Vehicle Routing we report an Incremental Local Optimisation heuristic, combined with Limited Discrepancy Search. Finally, we show how ad hoc algebras can considerably enhance the design of heuristics based on local and global search within a constraint-programming environment. Experiments on vehicle routing will enlighten how such a language for \u201csearch and insert\u201d control can enable automated tuning and discovery of new strategies adapted to the instances typology of the problem at stake.<\/jats:p>","DOI":"10.1017\/s0269888901000078","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T09:16:36Z","timestamp":1027761396000},"page":"41-68","source":"Crossref","is-referenced-by-count":11,"title":["Combining local and global search in a constraint programming environment"],"prefix":"10.48130","volume":"16","author":[{"given":"YVES","family":"CASEAU","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"FRAN\u00c7OIS","family":"LABURTHE","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"CLAUDE","family":"LE PAPE","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"BENO\u00ceT","family":"ROTTEMBOURG","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"27968","published-online":{"date-parts":[[2001,8,24]]},"container-title":["The Knowledge Engineering Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0269888901000078","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T14:43:14Z","timestamp":1767624194000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0269888901000078\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":0,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["S0269888901000078"],"URL":"https:\/\/doi.org\/10.1017\/s0269888901000078","relation":{},"ISSN":["0269-8889","1469-8005"],"issn-type":[{"type":"print","value":"0269-8889"},{"type":"electronic","value":"1469-8005"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}