.png){kind=icon}
.png){kind=icon}
Return
Enhancing set constraint solvers with bound consistency
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2017.09.056.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Constraint solvers have proved to be a powerful tool for both expressing and solving complex problems in many contexts, in particular in Automated Planning and Scheduling. In this work, we propose new constraints to enhancing an implementation of a constraint solver for sets of integers (ic_sets) embedded in the ECLIPSe system. This way, we confer a new vision of modelling that in particular allows a task to be planned on alternate days. In addition, these new constraints make finite domain and finite sets domains to cooperate, reducing the search space and improving the efficiency of the existing set solvers for some specific cases. We report on a prototype implementation and apply these constraints to modelling scheduling problems as benchmarks for a performance analysis. Experiments reveal a relevant improvement with respect to the standard ic_sets solver which only features cardinality as cooperation mechanism between domains. Both enhanced expressiveness and performance are key points for practical applications of such solvers. (C) 2017 Elsevier Ltd. All rights reserved.
Keywords:
Constraint programming
Scheduling
Integer set solvers
Finite domain constraints
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
2.9W
Citations:
10.2W