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.
Similar content being viewed by others
References
Balas, E., & Vazacopoulos, A. (1998). Guided local search with shifting bottleneck for job-shop scheduling. Manage. Sci. 44(2).
Bent, R., & Van Hentenryck, P. (2004). A two-stage hybrid local search for the vehicle routing problem with time windows. Transp. Sci. 8: 515–530
Codognet, C., & Diaz, D. (2001). Yet another local search method for constraint solving. In AAAI Fall Symposium on Using Uncertainty within Computation, Cape Cod, MA.
De Backer, B., et al. (2000). Solving vehicle routing problems using constraint programming and metaheuristics. Journal of Heuristics, 6: 501–523.
Dell’Amico, M., & Trubian, M. (1993). Applying tabu search to the job-shop scheduling problem. Ann. Oper. Res. 41: 231–252.
Di Gaspero, L., & Schaerf, A. (2002). Writing local search algorithms using EasyLocal++. In Optimization Software Class Libraries, Kluwer Academic Publishers, Boston, MA.
Galinier, P., & Hao, J.-K. (2000). A general approach for constraint solving by local search. In CP-AI-OR’00, Paderborn, Germany (March).
Johnson, D., Aragon, C., McGeoch, L., & Schevon, C. (1989). Optimization by simulated annealing: An experimental evaluation; part I, graph partitioning. Oper. Res. 37(6): 865–893.
Kernighan, B., & Lin, S. (1970). An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49: 291–307.
Kiczales, G., Lamping, J., Menhdhekar, A., Maeda, C., Lopes, C., Loingtier, J.-M., & Irwin, J. Aspect-oriented programming. In ECOOP ‘97.
Kindervater, G., & Savelsbergh, M.W. (1997). Vehicle routing: Handling edge exchanges. In Local Search in Combinatorial Optimization, Wiley, New York, NY.
Laburthe, F., & Caseau, Y. SALSA: A language for search algorithms. In CP’98.
Manolescu, D. (2002). Workflow enactment with continuation and future objects. In OOPLSA’02, Seattle, WA.
Michel, L., & Van Hentenryck, P. (2002). A constraint-based architecture for local search. In OOPLSA’02, Seattle, WA.
Michel, L., & Van Hentenryck, P. (2000). Localizer. Constraints, 5: 41–82.
Michel, L., & Van Hentenryck, P. (2002). A decomposition-based implementation of search strategies. ACM Transactions on Computational Logic.
Minton, S., Johnston, M., & Philips, A. Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method. In AAAI-90.
Nareyek, A. (1998). Constraint-Based Agents, Springer Verlag, New York, NY.
Nowicki, E., & Smutnicki, C. (1996). A fast taboo search algorithm for the job shop problem. Manage. Sci. 42(6): 797–813.
Perron, L. (1999). Search procedures and parallelism in constraint programming. In CP’99, Alexandra, VA.
Roy, B., & Sussmann, B. (1964). Les problèmes d’ordonnancement avec contraintes disjonctives. Note DS No. 9 bis, SEMA, Paris, France.
Schmidt, K. (2001). Using tabu-search to solve the job-shop scheduling problem with sequence dependent setup times. ScM Thesis, Brown University, Providence, RI.
Schulte, C. Comparing trailing and copying for constraint programming. In ICLP’99.
Shaw, P., De Backer, B., & Furnon, V. (2002). Improved local search for CP toolkits. Ann. Oper. Res. 115: 31–50.
Turner, C., Fuggetta, A., Lavazza, L., & Wolf, A. (1999). A conceptual basis for feature engineering. J. Syst. Softw. 49(1): 3–15.
Van Hentenryck, P., & Michel, L. (2003). Control abstractions for local search. In CP’03, Cork, Ireland.
Van Hentenryck, P., & Michel, Laurent. (2004). Scheduling abstractions for local search. Proceeding of the First International Conference on the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems (CP-AI-OR-04), Nice, France, April 2004.
Voss, S., & Woodruff, D. (2002). Optimization Software Class Libraries, Kluwer Academic Publishers, Boston, MA.
Walser, J. (1998). Integer Optimization by Local Search, Springer Verlag, New York, NY.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Van Hentenryck, P., Michel, L. Control Abstractions for Local Search. Constraints 10, 137–157 (2005). https://doi.org/10.1007/s10601-005-0553-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10601-005-0553-x