A 2-dimensional guillotine cutting stock problem with variable-sized stock for the honeycomb cardboard industry

被引:4
作者
Teran-Viadero, Paula [1 ]
Alonso-Ayuso, Antonio [2 ]
Martin-Campo, F. Javier [3 ]
机构
[1] Univ Complutense Madrid, Fac CC Matemat, Madrid, Spain
[2] Univ Rey Juan Carlos, DSLAB CETINIA, Mostoles, Madrid, Spain
[3] Univ Complutense Madrid, Dept Estadist & Invest Operat, Inst Matemat Interdisciplinar, Madrid, Spain
关键词
Cutting stock problem; 2-dimensional cutting; variable-sized stock; mixed integer linear optimisation; cardboard industry; LINEAR-PROGRAMMING APPROACH; PACKING PROBLEMS; MODELS; 3-STAGE;
D O I
10.1080/00207543.2023.2279129
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This paper introduces novel mathematical optimisation models for the 2-Dimensional guillotine Cutting Stock Problem with Variable-Sized Stock that appears in a Spanish company in the honeycomb cardboard industry. This problem mainly differs from the classical cutting stock problems in the stock, which is considered variable-sized, i.e. we have to decide the panel dimensions, width, and length. This approach is helpful in industries where the stock is produced simultaneously with the cutting process. The stock is then cut into smaller rectangular pieces that must meet the customers' requirements, such as the type of item, dimensions, demands, and technical specifications. Furthermore, in the problem tackled in this paper, the cuts are guillotine, performed side to side. The proposed mathematical models are validated using real data from the company, obtaining results that drastically reduce the produced material and leftovers, reducing operation times and economic costs.
引用
收藏
页码:483 / 500
页数:18
相关论文
共 44 条
[1]   A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems [J].
Alvarez-Valdes R. ;
Parajon A. ;
Tamarit J.M. .
OR Spectrum, 2002, 24 (2) :179-192
[2]   MIP models for two-dimensional non-guillotine cutting problems with usable leftovers [J].
Andrade, Ricardo ;
Birgin, Ernesto G. ;
Morabito, Reinaldo ;
Ronconi, Debora P. .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2014, 65 (11) :1649-1663
[3]   The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming [J].
Antonio, J ;
Chauvet, F ;
Chu, CB ;
Proth, JM .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 114 (02) :395-402
[4]   Modeling and solving a real-world cutting stock problem in the marble industry via mathematical programming and stochastic diffusion search approaches [J].
Baykasoglu, Adil ;
Ozbel, Burcu Kubur .
COMPUTERS & OPERATIONS RESEARCH, 2021, 128
[5]   Models for the two-dimensional level strip packing problem - a review and a computational evaluation [J].
Bezerra, Vanessa M. R. ;
Leao, Aline A. S. ;
Oliveira, Jose Fernando ;
Santos, Maristela O. .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2020, 71 (04) :606-627
[6]   Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation [J].
Cintra, G. F. ;
Miyazawa, F. K. ;
Wakabayashi, Y. ;
Xavier, E. C. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 191 (01) :61-85
[7]   The two-dimensional cutting stock problem with usable leftovers: mathematical modelling and heuristic approaches [J].
do Nascimento, Douglas Nogueira ;
Cherri, Adriana Cristina ;
Oliveira, Jose Fernando .
OPERATIONAL RESEARCH, 2022, 22 (05) :5363-5403
[8]   Exact algorithms for the two-dimensional guillotine knapsack [J].
Dolatabadi, Mohammad ;
Lodi, Andrea ;
Monaci, Michele .
COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (01) :48-53
[9]  
Dolgui A, 2010, SUPPLY CHAIN ENGINEERING: USEFUL METHODS AND TECHNIQUES, P1, DOI 10.1007/978-1-84996-017-5
[10]   A TYPOLOGY OF CUTTING AND PACKING PROBLEMS [J].
DYCKHOFF, H .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1990, 44 (02) :145-159