Optimizing Two-Dimensional Irregular Packing: A Hybrid Approach of Genetic Algorithm and Linear Programming

被引:3
|
作者
Liu, Cheng [1 ]
Si, Zhujun [1 ]
Hua, Jun [1 ]
Jia, Na [1 ]
机构
[1] Northeast Forestry Univ, Coll Mech & Elect Engn, Harbin 150040, Peoples R China
来源
APPLIED SCIENCES-BASEL | 2023年 / 13卷 / 22期
关键词
two-dimensional irregular packing; genetic algorithm; linear programming; no-fit-polygon; hybrid placement strategy; STRIP PACKING;
D O I
10.3390/app132212474
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
The problem of two-dimensional irregular packing involves the arrangement of objects with diverse shapes and sizes within a given area. This challenge arises across various industrial sectors, where effective packing optimization can yield cost savings, enhanced productivity, and reduced material waste. Existing methods for addressing the two-dimensional irregular packing problem encounter several challenges, such as limited computing resources, a prolonged solving time, and the propensity to converge to local optima. To address this issue, this study proposes a hybrid algorithm called the GA-LP algorithm to optimize the two-dimensional irregular packing problem in the manufacturing industry. The algorithm combines the global search capability of a genetic algorithm with the precise solving characteristics of linear programming. Matheuristics merges the advantages of metaheuristics, such as genetic algorithms, and mathematical programming, such as linear programming. The algorithm employs the no-fit-polygon technique along with the bottom-left and lowest-gravity center mixing placement strategies to acquire an initial solution via the utilization of a genetic algorithm. The algorithm then optimizes the solution obtained by the genetic algorithm using linear programming to obtain the final packing result. Experimental results, drawn from a real case involving the European Special Interest Group on Cutting and Packing (ESICUP) demonstrate that the GA-LP algorithm outperforms two hybrid algorithms from the relevant literature. Compared with recent methods, this algorithm can increase the best and average utilization rates by up to 5.89% and 4.02%, respectively, with important implications for improving work quality in areas such as packing and cutting.
引用
收藏
页数:20
相关论文
共 50 条
  • [31] A genetic approach for two dimensional packing with constraints
    Khoo, WS
    Saratchandran, P
    Sundararajan, N
    COMPUTATIONAL SCIENCE -- ICCS 2001, PROCEEDINGS PT 2, 2001, 2074 : 291 - 299
  • [32] Two-dimensional microwave imaging approach based on a genetic algorithm
    Caorsi, S
    Pastorino, M
    IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, 2000, 48 (03) : 370 - 373
  • [33] Heuristics for the two-dimensional irregular bin packing problem with limited rotations
    Cai, Sifan
    Deng, Jie
    Lee, Loo Hay
    Chew, Ek Peng
    Li, Haobin
    COMPUTERS & OPERATIONS RESEARCH, 2023, 160
  • [34] A biased genetic algorithm hybridized with VNS for the two-dimensional knapsack packing problem with defects
    Luo, Qiang
    Rao, Yunqing
    Guo, Xiaoqiang
    Du, Bing
    APPLIED SOFT COMPUTING, 2022, 118
  • [35] Two-dimensional batch linear programming on the GPU
    Charlton, John
    Maddock, Steve
    Richmond, Paul
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2019, 126 : 152 - 160
  • [36] A hybrid metaheuristic for the two-dimensional strip packing problem
    Grandcolas, Stephane
    Pain-Barre, Cyril
    ANNALS OF OPERATIONS RESEARCH, 2022, 309 (01) : 79 - 102
  • [37] A hybrid metaheuristic for the two-dimensional strip packing problem
    Stéphane Grandcolas
    Cyril Pain-Barre
    Annals of Operations Research, 2022, 309 : 79 - 102
  • [38] A 5-4 ALGORITHM FOR TWO-DIMENSIONAL PACKING
    BAKER, BS
    BROWN, DJ
    KATSEFF, HP
    JOURNAL OF ALGORITHMS, 1981, 2 (04) : 348 - 368
  • [39] A GENETIC ALGORITHM FOR TWO DIMENSIONAL STRIP PACKING PROBLEMS
    Mancapa, V.
    van Niekerk, T. I.
    Hua, T.
    SOUTH AFRICAN JOURNAL OF INDUSTRIAL ENGINEERING, 2009, 20 (02) : 145 - 162
  • [40] Two-dimensional packing problems using Genetic Algorithms
    Jain, S
    Gea, HC
    ENGINEERING WITH COMPUTERS, 1998, 14 (03) : 206 - 213