Abstract
Autonomous Search (AS) is a special feature allowing systems to improve their performance by self-adaptation. This approach has been recently adapted to Constraint Programming (CP) reporting promising results. However, as the research lies in a preliminary stage there is a lack of implementation frameworks and architectures. This hinders the research progress, which in particular, requires a considerable work in terms of experimentation. In this paper, we propose a new framework for implementing AS in CP. It allows a dynamic self-adaptation of the classic CP solving process and an easy update of its components, allowing developers to define their own AS-CP approaches. We believe this will help researchers to perform new AS experiments, and as a consequence to improve the current preliminary results.
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.
Similar content being viewed by others
References
Crawford, B., Montecinos, M., Castro, C., Monfroy, E.: A hyperheuristic approach to select enumeration strategies in constraint programming. In: Proceedings of ACT, pp. 265–267. IEEE Computer Society, Los Alamitos (2009)
Hamadi, Y., Monfroy, E., Saubion, F.: Special issue on autonomous search. Contraint Programming Letters 4 (2008)
Hamadi, Y., Monfroy, E., Saubion, F.: What is autonomous search? Technical Report MSR-TR-2008-80, Microsoft Research (2008)
Monfroy, E., Castro, C., Crawford, B.: Adaptive enumeration strategies and metabacktracks for constraint solving. In: Yakhno, T., Neuhold, E.J. (eds.) ADVIS 2006. LNCS, vol. 4243, pp. 354–363. Springer, Heidelberg (2006)
Robet, J., Lardeux, F., Saubion, F.: Autonomous control approach for local search. In: Stützle, T., Birattari, M., Hoos, H.H. (eds.) SLS 2009. LNCS, vol. 5752, pp. 130–134. Springer, Heidelberg (2009)
Rossi, F., van Beek, P., Walsh, T.: Handbook of Constraint Programming. Elsevier, Amsterdam (2006)
Soubeiga, E.: Development and Application of Hyperheuristics to Personnel Scheduling. PhD thesis, University of Nottingham School of Computer Science (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Crawford, B., Soto, R., Montecinos, M., Castro, C., Monfroy, E. (2011). A Framework for Autonomous Search in the Eclipse Solver. In: Mehrotra, K.G., Mohan, C.K., Oh, J.C., Varshney, P.K., Ali, M. (eds) Modern Approaches in Applied Intelligence. IEA/AIE 2011. Lecture Notes in Computer Science(), vol 6703. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21822-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-21822-4_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21821-7
Online ISBN: 978-3-642-21822-4
eBook Packages: Computer ScienceComputer Science (R0)