Learning from the Past to Dynamically Improve Search: A Case Study on the MOSP Problem

Authors:
Hadrien Cambazard;Narendra Jussien
Affiliations:
Cork Constraint Computation Centre Department of Computer Science, University College Cork, Ireland;École des Mines de Nantes --- LINA CNRS UMR 6241, Nantes Cedex 3, France F-44307
Venue:
Learning and Intelligent Optimization
Year:
2008

Citing 6
Cited 0

Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Local search with constraint propagation and conflict-based heuristics

Artificial Intelligence
A method for solving the minimization of the maximum number of open stacks problem within a cutting process

Computers and Operations Research
Dynamic Programming to Minimize the Maximum Number of Open Stacks

INFORMS Journal on Computing
Dynamic backtracking

Journal of Artificial Intelligence Research
Generalized nogoods in CSPs

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.01

Visualization

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.