Nondeterministic Control for Hybrid Search
- 50 Downloads
Hybrid algorithms combining local and systematic search often use nondeterminism in fundamentally different ways. They may differ in the strategy to explore the search tree and/or in how computation states are represented. This paper presents nondeterministic control structures to express a variety of hybrid search algorithms concisely and elegantly. These nondeterministic abstractions describe the search tree and are compiled in terms of first-class continuations. They are also parameterized by search controllers that are under user control and specify the state representation and the exploration strategy. The resulting search language is thus high-level, flexible, and directly extensible. The abstractions are illustrated on a jobshop scheduling algorithm that combines tabu search and a limited form of backtracking. Preliminary experimental results indicate that the control structures induce small, often negligible, overheads.
Keywordsconstraint language local search hybrid search non determinism continuation closure solution checkpoint search procedure
Unable to display preview. Download preview PDF.
- 3.de Givry, S., & Jeannin, L. (2003). Tools: A library for partial and hybrid search methods. In CP-AI-OR’03, Montreal, Canada.Google Scholar
- 4.Laburthe, F., & Caseau, Y. (1998). SALSA: A language for search algorithms. In CP’98, Pisa, Italy.Google Scholar
- 5.Michel, L., & Van Hentenryck, P. (2002). A constraint-based architecture for local search. In OOPSLA’02., pages 101–110. Seattle, Washington.Google Scholar
- 8.Perron, L. (1999). Search procedures and parallelism in constraint programming. In CP’99, pages 346–360. Alexandra, Virginia.Google Scholar
- 10.Schulte, C. (1997). Programming constraint inference engines. In CP’97, pages 519–533. Linz, Austria.Google Scholar
- 11.Schulte, C. (1999) Comparing trailing and copying for constraint programming. In ICLP-99, pages 275–289. Las Cruces, New Mexico.Google Scholar
- 12.Shaw, P. (1998). Using constraint programming and local search methods to solve vehicle routing problems. In CP’98, pages 417–431. Pisa, Italy.Google Scholar
- 13.Van Hentenryck, P. (1999). The OPL Optimization Programming Language. Cambridge, Massachusetts: MIT.Google Scholar
- 14.Van Hentenryck, P., & Michel, L. (2003). Control abstractions for local search. In CP’03, pages 65–80. Cork, Ireland.Google Scholar
- 15.Van Hentenryck, P., & Michel, L. (2004). Scheduling abstractions for local search. In CP-AI-OR’04, pages 319–334. Nice, France.Google Scholar
- 16.Van Hentenryck, P., Michel, L., & Liu, L. (2004). Constraint-based combinators for local search. In CP’04. Toronto, Canada.Google Scholar