Abstract
The steel mill slab design problem from the CSPLIB is real-life 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dawande, M., Kalagnanam, J., Sethuraman, J.: Variable-sized bin packing with color constraints. Electronic Notes in Discrete Mathematics 7 (2001)
Forrest, J., Ladanyi, L., Kalagnanam, J.: A column-generation approach to the multiple knapsack problem with color constraints. INFORMS Journal on Computing 18(1), 129–134 (2006)
Frisch, A., Miguel, I., Walsh, T.: Modelling a steel mill slab design problem. In: Proceedings of the IJCAI-01 Workshop on Modelling and Solving Problems with Constraints (2001)
Frisch, A., Miguel, I., Walsh, T.: Symmetry and implied constraints in the steel mill slab design problem. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239. Springer, Heidelberg (2001)
Hnich, B., Kiziltan, Z., Miguel, I., Walsh, T.: Hybrid modelling for robust solving. Annals of Operations Research 130(1-4), 19–39 (2004)
Kalagnanam, J., Dawande, M., Trumbo, M., Lee, H.S.: Inventory matching problems in the steel industry. Technical Report RC 21171, IBM Research Report, T.J. Watson Research Center (1988)
Prestwich, S.: Search and modelling issues in steel mill slab design. Technical Report 4/148, Cork Constraint Computation Center (2002)
Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417–431. Springer, Heidelberg (1998)
Shaw, P.: A constraint for bin-packing. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 648–662. Springer, Heidelberg (2004)
Trick, M.: A dynamic programming approach for consistency and propagation for knapsack constraints. In: Proceedings of the Third International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2001), Lille, France, pp. 113–124 (2001)
van Hentenryck, P., Michel, L.: Constraint-Based Local Search. MIT Press, Cambridge, Mass. (2005)
Walser, J.P.: Solving linear pseudo-boolean constraints with local search. In: Proceedings of the Eleventh Conference on Artificial Intelligence, pp. 269–274 (1997)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gargani, A., Refalo, P. (2007). An Efficient Model and Strategy for the Steel Mill Slab Design Problem. In: Bessière, C. (eds) Principles and Practice of Constraint Programming – CP 2007. CP 2007. Lecture Notes in Computer Science, vol 4741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74970-7_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-74970-7_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74969-1
Online ISBN: 978-3-540-74970-7
eBook Packages: Computer ScienceComputer Science (R0)