Abstract
This paper presents a study conducted on the minimum number of open stacks problem (MOSP) which occurs in various production environments where an efficient simultaneous utilization of resources (stacks) is needed to achieve a set of tasks. We investigate through this problem how classical look-back reasonings based on explanations could be used to prune the search space and design a new solving technique. Explanations have often been used to design intelligent backtracking mechanisms in Constraint Programming whereas their use in nogood recording schemes has been less investigated. In this paper, we introduce a generalized nogood (embedding explanation mechanisms) for the MOSP that leads to a new solving technique and can provide explanations.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Becceneri, J.C., Yannasse, H.H., Soma, N.Y.: A method for solving the minimization of the maximum number of open stacks problem within a cutting process. C&OR 31, 2315–2332 (2004)
Benoist, T.: A dynamic programming approach. In: IJCAI 2005 Fifth Workshop on Modelling and Solving Problems with Constraints (2005)
Garcia de la Banda, M., Stuckey, P.J.: Using dynamic programming to minimize the maximum number of open stacks. INFORMS Journal of Computing (2007)
Ginsberg, M.: Dynamic backtracking. Journal of Artificial Intelligence Research 1, 25–46 (1993)
Junker, U.: QuickXplain: Conflict detection for arbitrary constraint propagation algorithms. In: IJCAI 2001 Workshop on Modelling and Solving problems with constraints (2001)
Jussien, N., Lhomme, O.: Local search with constraint propagation and conflict-based heuristics. Artificial Intelligence 139(1), 21–45 (2002)
Katsirelos, G., Bacchus, F.: Generalized nogoods in csps. In: National Conference on Artificial Intelligence (AAAI 2005), pp. 390–396 (2005)
Knuth, D.E.: Sorting and Searching. The Art of Computer Programming, vol. 3, pp. 492–512. Addison-Wesley, Reading (1997)
Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proceedings of the 38th Design Automation Conference (DAC 2001) (2001)
Prosser, P.: MAC-CBJ: maintaining arc consistency with conflict-directed backjumping. Technical Report Research Report/95/177, Dept. of Computer Science, University of Strathclyde (1995)
Schiex, T., Verfaillie, G.: Nogood recording for static and dynamic constraint satisfaction problem. IJAIT 3(2), 187–207 (1994)
Shaw, P., Laborie, P.: A constraint programming approach to the min-stack problem. In: IJCAI 2005 Fifth Workshop on Modelling and Solving Problems with Constraints (2005)
De Siqueira, J.L., Puget, J.F.: Explanation-based generalisation of failures. In (ECAI 1988), pp. 339–344 (1988)
Smith, B., Gent, I.: Constraint modelling challenge 2005. In: IJCAI 2005 Fifth Workshop on Modelling and Solving Problems with Constraints (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cambazard, H., Jussien, N. (2008). Learning from the Past to Dynamically Improve Search: A Case Study on the MOSP Problem. In: Maniezzo, V., Battiti, R., Watson, JP. (eds) Learning and Intelligent Optimization. LION 2007. Lecture Notes in Computer Science, vol 5313. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92695-5_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-92695-5_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92694-8
Online ISBN: 978-3-540-92695-5
eBook Packages: Computer ScienceComputer Science (R0)