An efficient model and strategy for the steel mill slab design problem

Authors:
Antoine Gargani;Philippe Refalo
Affiliations:
ILOG, Gentilly Cedex, France;ILOG, Sophia-Antipolis, France
Venue:
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Year:
2007

Citing 3
Cited 5

Constraint-Based Local Search

Constraint-Based Local Search
A Column-Generation Approach to the Multiple Knapsack Problem with Color Constraints

INFORMS Journal on Computing
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

Breaking value symmetry

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
The steel mill slab design problem revisited

CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Solving Steel Mill Slab Problems with constraint-based techniques: CP, LNS, and CBLS

Constraints
Solving steel mill slab design problems

Constraints
A generic method for identifying and exploiting dominance relations

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

The steel mill slab design problem from the CSPLIB is reallife problem from the steel industry. Finding optimal solutions to this problem is difficult. Existing constraint programming approaches can solve problems up to 30 orders. We propose a strong constraint programming model based on logical and global constraints. By designing a specific strategy for variable and value selection, we are able to solve instances having more than 70 orders to optimality using depth-first search. Injecting this strategy into a large neighborhood search, we are able to solve the real-life instance of the CSPLIB having 111 orders in just 3 seconds.