Mixed-integer Programming Model for Two-dimensional Non-guillotine Bin Packing Problem with Free Rotation

被引：2

作者：

Ma, Ning ^{[1
,2
]}

Zhou, Zhili ^{[1
,2
]}

机构：

[1] Xi An Jiao Tong Univ, Sch Management, Xian 710049, Peoples R China

[2] Xi An Jiao Tong Univ, State Key Lab Mfg Syst Engn, Xian 710054, Shaanxi, Peoples R China

来源：

2017 4TH INTERNATIONAL CONFERENCE ON INFORMATION SCIENCE AND CONTROL ENGINEERING (ICISCE) | 2017年

基金：

中国国家自然科学基金;

关键词：

two-dimensional; non-guillotine; free rotation; bin packing problem; mixed-integer programming model; CUTTING PROBLEMS; ALGORITHM; TYPOLOGY;

D O I：

10.1109/ICISCE.2017.102

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Two-dimensional bin packing problem (2BPP) is a classical problem in operations research and has been extensively investigated in the past years. The 2BPP can be classified according to choices of the orientation (fixed orientation or 90 degrees rotated) and the cut type (guillotine or non-guillotine cut). Many mathematical models and solution methods have been proposed for the problem. However, due to the difficulty in representing constraints, no exact mathematical model is presented for the two-dimensional non-guillotine bin packing problem with free rotation (2BPP-NR). In this paper, we present two Mixed-integer programming (MIP) models for the 2BPP-NR. Computational experiments are conducted on random problem instances and comparative analyses of the proposed models are presents. Results show the Model II outperforms the Model I in both number of constraints and computational time.

引用

页码：456 / 460

页数：5

共 50 条

[1] The Floating-Cuts model: a general and flexible mixed-integer programming model for non-guillotine and guillotine rectangular cutting problems
Silva, Elsa
Oliveira, Jose Fernando
Silveira, Tiago
Mundim, Leandro
Carravilla, Maria Antonia
[J]. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2023, 114
[2] A DC programming approach for the constrained two-dimensional non-guillotine cutting problem
Moeini, Mahdi
Hoai An Le Thi
[J]. PROCEEDINGS OF INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IESM'2011): INNOVATIVE APPROACHES AND TECHNOLOGIES FOR NETWORKED MANUFACTURING ENTERPRISES MANAGEMENT, 2011, : 212 - 221
[3] A Dedicated Genetic Algorithm for Two-Dimensional Non-Guillotine Strip Packing
Gomez-Villouta, Giglia
Hamiez, Jean-Philippe
Hao, Jin-Kao
[J]. MICAI 2007: SIXTH MEXICAN INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2008, : 264 - 274
[4] Constrained two-dimensional non-guillotine cutting problem: an evolutionary approach
Beraudo, V
Alfonso, H
Minetti, G
Salto, C
[J]. SCCC 2004: XXIV INTERNATIONAL CONFERENCE OF THE CHILEAN COMPUTER SCIENCE SOCIETY, 2004, : 84 - 89
[5] A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
Charalambous, Christoforos
Fleszar, Krzysztof
[J]. COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (10) : 1443 - 1451
[6] A tabu search algorithm for a two-dimensional non-guillotine cutting problem
Alvarez-Valdes, R.
Parreno, F.
Tamarit, J. M.
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 183 (03) : 1167 - 1182
[7] Partial enumeration algorithms for Two-Dimensional Bin Packing Problem with guillotine constraints
Lodi, Andrea
Monaci, Michele
Pietrobuoni, Enrico
[J]. DISCRETE APPLIED MATHEMATICS, 2017, 217 : 40 - 47
[8] An agent-based approach to the two-dimensional guillotine bin packing problem
Polyakovsky, Sergey
M'Hallah, Rym
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 192 (03) : 767 - 781
[9] Hybrid genetic algorithm and simulated annealing for two-dimensional non-guillotine rectangular packing problems
Soke, Alev
Bingul, Zafer
[J]. ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2006, 19 (05) : 557 - 567
[10] The multiperiod two-dimensional non-guillotine cutting stock problem with usable leftovers
Birgin, E. G.
Romao, O. C.
Ronconi, D. P.
[J]. INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2020, 27 (03) : 1392 - 1418

← 1 2 3 4 5 →