Abstract
This paper investigates the mother plate design (MPD) problem which is a typical problem in the production planning of steel plants. The MPD problem refers to a variant of the two-dimensional variable-sized bin packing problem in which the height of a bin is in a given finite set and the width of each bin is continuous in an interval. The problem is first formulated as a mixed integer nonlinear programming model and then linearized into a mixed integer programming model. We present a column generation-based (CG-based) algorithm to approximately solve the MPD problem, in which a height combination scheme is devised to decrease the dimensions of the pricing sub-problem. We present an accelerated CG (ACG) algorithm with improved performance which adopts two heuristic accelerating strategies in the pricing process. We use practical instances collected from a Chinese steel plant to test the performance of the proposed algorithms. The results indicate that the ACG algorithm is suitable for solving real-world instances.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alves C, Carvalho JMVD (2007) Accelerating column generation for variable sized bin-packing problems. Eur J Oper Res 183(3):1333–1352
Alves C, Carvalho JMVD (2008) A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem. Comput Oper Res 35(4):1315–1328
Belov G, Scheithauer G (2002) A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths. Eur J Oper Res 141(2):274–294
Cintra G, Miyazawa FK, Wakabayashi Y, Xavier E (2008) Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation. Eur J Oper Res 191(1):61–85
Dash S, Kalagnanam J, Reddy C (2007) Production design for plate products in the steel industry. IBM J Res Dev 51(3):345–362
Degraeve Z, Peeters M (2003) Optimal integer solutions to industrial cutting-stock problems: part 2, benchmark results. INFORMS J Comput 15(1):58–81
Dell’Amico M, Martello S (2002) A lower bound for the non-oriented two-dimensional bin packing problem. Discret Appl Math 118(1–2):13–24
Furini F, Malaguti E, Durán RM, Persiani A, Toth P (2012) A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size. Eur J Oper Res 218(1):251–260
Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. J Symb Log 48(2):498–500
Gilmore PC, Gomory RE (1963) A linear programming approach to the cutting-stock problem-Part II. Oper Res 11(6):863–888
Hong S, Zhang D, Lau HC, Zeng X, Si YW (2014) A hybrid heuristic algorithm for the 2D variable-sized bin packing problem. Eur J Oper Res 238(1):95–103
Kang J, Park S (2003) Algorithms for the variable sized bin packing problem. Eur J Oper Res 147(2):365–372
Liu Y, Chu C, Wang K (2011) A dynamic programming-based heuristic for the variable sized two-dimensional bin packing problem. Int J Prod Res 49(13):3815–3831
Liu Y, Chu C, Wu F (2014) A heuristic for variable size multiobjective two-dimensional bin packing. Int J Prod Res 52(12):3450–3465
Lodi A, Martello S, Monaci M (2002) Two-dimensional packing problems: a survey. Eur J Oper Res 141(2):241–252
Lodi A, Martello S, Vigo D (1999) Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS J Comput 11(4):345–357
Martello S, Vigo D (1998) Exact solution of the two-dimensional finite bin packing problem. Manag Sci 44(3):388–399
Ortmann FG, Ntene N, van Vuuren JH (2010) New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems. Eur J Oper Res 203(2):306–315
Park S (2007) Two-dimensional bin packing problems in steel industry. Dissertation, Pohang University of Science and Technology
Pisinger D, Sigurd M (2005) The two-dimensional bin packing problem with variable bin sizes and costs. Discret Optim 2(2):154–167
Puchinger J, Raidl GR (2004) An evolutionary algorithm for column generation in integer programming: an effective approach for 2D bin packing. In: International conference on parallel problem solving from nature. Springer, Berlin, Heidelberg, pp 642–651
Wei L, Oon WC, Zhu W, Lim A (2013) A goal-driven approach to the 2D bin packing and variable-sized bin packing problems. Eur J Oper Res 224(1):110–121
Wy J, Kim BI (2010) Two-staged guillotine cut, two-dimensional bin packing optimisation with flexible bin size for steel mother plate design. Int J Prod Res 48(22):6799–6820
Acknowledgements
This work was partially supported by National Key R&D Program of China (2017YFB0304200), National Natural Science Foundation of China (62073069, 71971050, 71831006).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Zhang, Q., Liu, S., Zhang, R. et al. Column generation algorithms for mother plate design in steel plants. OR Spectrum 43, 127–153 (2021). https://doi.org/10.1007/s00291-020-00610-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00291-020-00610-z