Solving two-dimensional irregular cutting problem: Case study using GRASP meta-heuristics approach

被引:0
|
作者
Dammak, Khouloud [1 ]
Mezghani, Salma [1 ]
Moalla, Hela Frikha [1 ]
机构
[1] Sfax Univ, Lab Optimisat Logist & Informat Decis OLID, Sfax, Tunisia
关键词
irregular Cutting; Two-dimensional; Grasp; manufacturing company; TYPOLOGY;
D O I
10.1109/DASA53625.2021.9682358
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Cutting problems occur in the context of some real-world applications, both in the industrial and service industries, where one or more large objects need to be split into smaller units to minimize waste. It is a complicated combination optimization. The manufacture of furniture requires irregular geometric shapes and very specific. For that the furniture industries encounter several optimizations of cutting phase problems at the level of the of the raw material. Our case study addresses the problem of cutting irregular shapes specific for sofa fabrication. In this paper the greedy randomized adaptive search process (GRASP) metaheuristic algorithm is modified to address the issue by offering a high-quality solution in a timely manner. The piece shape (convexity and regularity) has no influence on the algorithm
引用
收藏
页数:4
相关论文
共 50 条
  • [21] A decomposition approach based on meta-heuristics and exact methods for solving a two-stage stochastic biofuel hub-and-spoke network problem
    Aboytes-Ojeda, Mario
    Castillo-Villar, Krystel K.
    Roni, Mohammad S.
    JOURNAL OF CLEANER PRODUCTION, 2020, 247
  • [22] New approach to solving a two-dimensional problem for an orthotropic plate
    Kosmodamianskii A.S.
    Journal of Mathematical Sciences, 2001, 103 (3) : 331 - 333
  • [23] Solving two-dimensional cutting stock problem via a DNA computing algorithm
    M. Dodge
    S. A. MirHassani
    F. Hooshmand
    Natural Computing, 2021, 20 : 145 - 159
  • [24] Solving two-dimensional cutting stock problem via a DNA computing algorithm
    Dodge, M.
    MirHassani, S. A.
    Hooshmand, F.
    NATURAL COMPUTING, 2021, 20 (01) : 145 - 159
  • [25] SOLVING TWO-DIMENSIONAL BIN PACKING PROBLEMS WITH TWO-STAGE GUILLOTINE CUTTING BY COMBINED LOCAL SEARCH HEURISTICS
    Chan, T. M.
    Alvelos, Filipe
    Silva, Elsa
    Valerio de Carvalho, J. M.
    PACIFIC JOURNAL OF OPTIMIZATION, 2013, 9 (03): : 391 - 412
  • [26] An exact approach for the constrained two-dimensional guillotine cutting problem with defects
    Zhang, Hao
    Yao, Shaowen
    Liu, Qiang
    Wei, Lijun
    Lin, Libin
    Leng, Jiewu
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2023, 61 (09) : 2985 - 3002
  • [27] A pattern combination based approach to two-dimensional Cutting Stock Problem
    Wan, JM
    Wu, YD
    Dai, HW
    ADVANCES IN NATURAL COMPUTATION, PT 3, PROCEEDINGS, 2005, 3612 : 332 - 336
  • [28] Width-Packing Heuristic for Grouping in Two-Dimensional Irregular Shapes Cutting Stock Problem
    Aliya Awais
    Anjum Naveed
    Arabian Journal for Science and Engineering, 2015, 40 : 799 - 816
  • [29] Width-Packing Heuristic for Grouping in Two-Dimensional Irregular Shapes Cutting Stock Problem
    Awais, Aliya
    Naveed, Anjum
    ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2015, 40 (03) : 799 - 816
  • [30] A Meta-Learning Approach to Select Meta-Heuristics for the Traveling Salesman Problem Using MLP-Based Label Ranking
    Kanda, Jorge
    Soares, Carlos
    Hruschka, Eduardo
    de Carvalho, Andre
    NEURAL INFORMATION PROCESSING, ICONIP 2012, PT III, 2012, 7665 : 488 - 495