NDLI: Solving Steel Mill Slab Problems with constraint-based techniques: CP, LNS, and CBLS

Please wait, while we are loading the content...

Solving Steel Mill Slab Problems with constraint-based techniques: CP, LNS, and CBLS

Content Provider	Springer Nature Link
Author	Schaus, Pierre Hentenryck, Pascal Monette, Jean ël Coffrin, Carleton Michel, Laurent Deville, Yves
Copyright Year	2010
Abstract	The Steel Mill Slab Problem is an optimization benchmark that has been studied for a long time in the constraint-programming community but was only solved efficiently in the two last years. Gargani and Refalo solved the problem using Large Neighborhood Search and Van Hentenryck and Michel made use of constraint programming with an improved symmetry breaking scheme. In the first part of this paper, we build on those approaches, present improvements of those two techniques, and study how the problem can be tackled by Constraint-Based Local Search. As a result, the classical instances of CSPLib can now be solved in less than 50 ms. To improve our understanding of this problem, we also introduce a new set of harder instances, which highlight the strengths and the weaknesses of the various approaches. In a second part of the paper, we present a variation of the Steel Mill Slab Problem whose aim is to minimize the number of slabs. We show how this problem can be tackled with slight modifications of our proposed algorithms. In particular, the constraint-programming solution is enhanced by a global symmetric cardinality constraint, which, to our knowledge, has never been implemented and used before. All the proposed approaches to solve this problem have been modeled and evaluated using Comet.
Starting Page	125
Ending Page	147
Page Count	23
File Format	PDF
ISSN	13837133
Journal	Constraints
Volume Number	16
Issue Number	2
e-ISSN	15729354
Language	English
Publisher	Springer US
Publisher Date	2010-08-18
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Steel Mill Slab Constraint optimization Local search Large neighborhood search Symmetric cardinality constraint Set cardinality constraint Operations Research/Decision Theory Computing Methodologies Optimization Artificial Intelligence (incl. Robotics)
Content Type	Text
Resource Type	Article
Subject	Discrete Mathematics and Combinatorics Artificial Intelligence Computational Theory and Mathematics Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Solving steel mill slab problems with constraint-based techniques: cp, lns, and cbls (2010).

Solving steel mill slab design problems

Explanation-based large neighborhood search

Constraint-based Very Large-Scale Neighborhood search

Solving subgraph isomorphism problems with constraint programming

Constraint satisfaction for planning and scheduling problems

Lexicographically-ordered constraint satisfaction problems

Symmetry Definitions for Constraint Satisfaction Problems

Constraint models for graceful graphs

Solving Steel Mill Slab Problems with constraint-based techniques: CP, LNS, and CBLS

Similar Documents

Solving steel mill slab problems with constraint-based techniques: cp, lns, and cbls (2010).

Solving steel mill slab design problems

Explanation-based large neighborhood search

Constraint-based Very Large-Scale Neighborhood search

Solving subgraph isomorphism problems with constraint programming

Constraint satisfaction for planning and scheduling problems

Lexicographically-ordered constraint satisfaction problems

Symmetry Definitions for Constraint Satisfaction Problems

Constraint models for graceful graphs

Solving Steel Mill Slab Problems with constraint-based techniques: CP, LNS, and CBLS