The steel mill slab design problem revisited

Authors:
P. Van Hentenryck;L. Michel
Affiliations:
Brown University, Providence, RI;University of Connecticut, Storrs, CT
Venue:
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Year:
2008

Citing 3
Cited 6

Tractable symmetry breaking for CSPs with interchangeable values

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
An efficient model and strategy for the steel mill slab design problem

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Solving linear pseudo-Boolean constraint problems with local search

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence

Scalable Load Balancing in Nurse to Patient Assignment Problems

CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Breaking value symmetry

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Solving Steel Mill Slab Problems with constraint-based techniques: CP, LNS, and CBLS

Constraints
Synthesis of search algorithms from high-level CP models

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Constraint reasoning and Kernel clustering for pattern decomposition with scaling

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Solving steel mill slab design problems

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, Gargani and Refalo (G&R) presented an elegant model for the Steel Mill Slab Design Problem (Problem 38 in the CSP LIB). Contrary to earlier approaches, their model does not use 0/1 variables but exploits the traditional expressiveness of constraint programming. G&R indicated that static symmetry-breaking constraints proposed earlier are not effective on this model, as these interact with their heuristic. Instead they use large neighborhood search to obtain solutions quickly. This paper shows that a simple search procedure breaking symmetries dynamically leads to a constraint program solving the problem in a few seconds, while maintaining the completeness of the approach and removing the need for large neighborhood search.