Abstract
Comet is an object-oriented language supporting a constraint-based architecture for local search through declarative and search components. This paper proposes three novel and lightweight control abstractions for the search component, significantly enhancing the compositionality, modularity, and reuse of Comet programs. These abstractions, which includes events and checkpoints, rely on first-class closures as the enabling technology. They are especially useful for expressing, in a modular way, heuristic and meta-heuristics, unions of heterogeneous neighborhoods, and sequential composition of neighborhoods.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Balas, E., Vazacopoulos, A.: Guided local search with shifting bottleneck for job-shop scheduling. Management Science 44(2) (1998)
Bent, R., Van Hentenryck, P.: A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows. Transportation Science (2001) (to appear)
Codognet, C., Diaz, D.: Yet Another Local Search Method for Constraint Solving. In: AAAI Fall Symposium on Using Uncertainty within Computation, Cape Cod, MA (2001)
De Backer, B., et al.: Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics. Journal of Heuristics 6, 501–523 (2000)
Dell’Amico, M., Trubian, M.: Applying Tabu Search to the Job-Shop Scheduling Problem. Annals of Operations Research 41, 231–252 (1993)
Di Gaspero, L., Schaerf, A.: Writing Local Search Algorithms Using EasyLocal++. In: Optimization Software Class Libraries. Kluwer, Dordrecht (2002)
Galinier, P., Hao, J.-K.: A General Approach for Constraint Solving by Local Search. In: CP-AI-OR 2000, Paderborn, Germany (March 2000)
Kernighan, B., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal 49, 291–307 (1970)
Kiczales, G., Lamping, J., Menhdhekar, A., Maeda, C., Lopes, C., Loingtier, J.-M., Irwin, J.: Aspect-oriented programming. In: Aksit, M., Matsuoka, S. (eds.) ECOOP 1997. LNCS, vol. 1241, pp. 220–242. Springer, Heidelberg (1997)
Kindervater, G., Savelsbergh, M.W.: Vehicle routing: Handling edge exchanges. In: Local Search in Combinatorial Optimization. Wiley, Chichester (1997)
Laburthe, F., Caseau, Y.: SALSA: A Language for Search Algorithms. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, p. 310. Springer, Heidelberg (1998)
Manolescu, D.: Workflow Enactment with Continuation and Future Objects. In: OOPLSA 2002, Seattle, WA (2002)
Michel, L., Van Hentenryck, P.: A Constraint-Based Architecture for Local Search. In: OOPLSA 2002, Seattle, WA (2002)
Michel, L., Van Hentenryck, P.: Localizer. Constraints 5, 41–82 (2000)
Michel, L., Van Hentenryck, P.: A Decomposition-Based Implementation of Search Strategies. ACM Transactions on Computational Logic (2002) (to appear)
Minton, S., Johnston, M., Philips, A.: Solving Large-Scale Constraint Satisfaction and Scheduling Problems using a Heuristic Repair Method. In: AAAI 1990 (1990)
Nareyek, A.: Constraint-Based Agents. Springer, Heidelberg (1998)
Nowicki, E., Smutnicki, C.: A fast taboo search algorithm for the job shop problem. Management Science 42(6), 797–813 (1996)
Perron, L.: Search Procedures and Parallelism in Constraint Programming. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 346–361. Springer, Heidelberg (1999)
Roy, B., Sussmann, B.: Les problèmes d’ordonnancement avec contraintes disjonctives. Note DS No. 9 bis, SEMA, Paris, France (1964)
Schmidt, K.: Using Tabu-search to Solve the Job-Shop Scheduling Problem with Sequence Dependent Setup Times. ScM Thesis, Brown University (2001)
Schulte, C.: Comparing trailing and copying for constraint programming. In: ICLP 1999 (1999)
Shaw, P., De Backer, B., Furnon, V.: Improved local search for CP toolkits. Annals of Operations Research 115, 31–50 (2002)
Turner, C., Fuggetta, A., Lavazza, L., Wolf, A.: A conceptual basis for feature engineering. Journal of Systems and Software 49(1), 3–15 (1999)
Voss, S., Woodruff, D.: Optimization Software Class Libraries. Kluwer, Dordrecht (2002)
Walser, J.: Integer Optimization by Local Search. Springer, Heidelberg (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Van Hentenryck, P., Michel, L. (2003). Control Abstractions for Local Search. In: Rossi, F. (eds) Principles and Practice of Constraint Programming – CP 2003. CP 2003. Lecture Notes in Computer Science, vol 2833. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45193-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-45193-8_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20202-8
Online ISBN: 978-3-540-45193-8
eBook Packages: Springer Book Archive