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 条
  • [21] Solving the two-dimensional irregular objects allocation problems by using a two-stage packing approach
    Wong, W. K.
    Wang, X. X.
    Mok, P. Y.
    Leung, S. Y. S.
    Kwong, C. K.
    EXPERT SYSTEMS WITH APPLICATIONS, 2009, 36 (02) : 3489 - 3496
  • [22] A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
    Leung, Stephen C. H.
    Zhang, Defu
    Zhou, Changle
    Wu, Tao
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (01) : 64 - 73
  • [23] A hybrid simulated-annealing algorithm for two-dimensional strip packing problem
    Dereli, Turkay
    Das, Guiesin Sena
    ADAPTIVE AND NATURAL COMPUTING ALGORITHMS, PT 1, 2007, 4431 : 508 - +
  • [24] Grids algorithm for two-dimensional irregular domains
    The 31st Research Inst, Beijing, China
    Tuijin Jishu, 1 (73-75, 98):
  • [25] A Dedicated Genetic Algorithm for Two-Dimensional Non-Guillotine Strip Packing
    Gomez-Villouta, Giglia
    Hamiez, Jean-Philippe
    Hao, Jin-Kao
    MICAI 2007: SIXTH MEXICAN INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2008, : 264 - 274
  • [26] Two-dimensional phase unwrapping using a hybrid genetic algorithm
    Karout, Salah A.
    Gdeisat, Munther A.
    Burton, David R.
    Lalor, Michael J.
    APPLIED OPTICS, 2007, 46 (05) : 730 - 743
  • [28] Ensemble of hybrid genetic algorithm for two-dimensional phase unwrapping
    Balakrishnan, D.
    Quan, C.
    Tay, C. J.
    INTERNATIONAL CONFERENCE ON OPTICS IN PRECISION ENGINEERING AND NANOTECHNOLOGY (ICOPEN2013), 2013, 8769
  • [29] Hybrid approach for the two-dimensional bin packing problem with two-staged patterns
    Cui, Yaodong
    Yao, Yi
    Cui, Yi-Ping
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2016, 23 (03) : 539 - 549
  • [30] A biased random-key genetic algorithm using dotted board model for solving two-dimensional irregular strip packing problems
    Amaro Junior, Bonfim
    da Costa, Rodrigo Lima
    Pinheiro, Placido Rogerio
    Pires de Araujo, Luiz Jonata
    Grichshenko, Alexandr
    2020 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2020,