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 条
  • [1] A GRASP meta-heuristic for two-dimensional irregular cutting stock problem
    S. A. MirHassani
    A. Jalaeian Bashirzadeh
    The International Journal of Advanced Manufacturing Technology, 2015, 81 : 455 - 464
  • [2] A GRASP meta-heuristic for two-dimensional irregular cutting stock problem
    MirHassani, S. A.
    Bashirzadeh, A. Jalaeian
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2015, 81 (1-4): : 455 - 464
  • [3] Meta-heuristics for Solving Nurse Scheduling Problem: A Comparative Study
    Karmakar, Snehasish
    Chakraborty, Sugato
    Chatterjee, Tryambak
    Baidya, Arindam
    Acharyya, Sriyankar
    2016 2ND INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING, COMMUNICATION, & AUTOMATION (ICACCA) (FALL), 2016, : 40 - 44
  • [4] Meta-heuristics for the one-dimensional cutting stock problem with usable leftover
    Santiago V. Ravelo
    Cláudio N. Meneses
    Maristela O. Santos
    Journal of Heuristics, 2020, 26 : 585 - 618
  • [5] Two meta-heuristics for solving the capacitated vehicle routing problem: the case of the Tunisian Post Office
    Sbai, Ines
    Krichen, Saoussen
    Limam, Olfa
    OPERATIONAL RESEARCH, 2022, 22 (01) : 507 - 549
  • [6] Meta-heuristics for the one-dimensional cutting stock problem with usable leftover
    Ravelo, Santiago V.
    Meneses, Claudio N.
    Santos, Maristela O.
    JOURNAL OF HEURISTICS, 2020, 26 (04) : 585 - 618
  • [7] Two meta-heuristics for solving the capacitated vehicle routing problem: the case of the Tunisian Post Office
    Ines Sbai
    Saoussen Krichen
    Olfa Limam
    Operational Research, 2022, 22 : 507 - 549
  • [8] Solving the Mask Data Preparation Scheduling Problem Using Meta-Heuristics
    Ying, Kuo-Ching
    Lin, Shih-Wei
    Huang, Chien-Yi
    Liu, Memphis
    Lin, Chia-Tien
    IEEE ACCESS, 2019, 7 : 24192 - 24203
  • [9] Heuristics for the two-dimensional cutting stock problem with usable leftover
    Chen, Qiulian
    Chen, Yan
    INTELLIGENT DATA ANALYSIS, 2024, 28 (02) : 591 - 611
  • [10] Using GPU Computing for Solving the Two-Dimensional Guillotine Cutting Problem
    Boschetti, Marco A.
    Maniezzo, Vittorio
    Strappaveccia, Francesco
    INFORMS JOURNAL ON COMPUTING, 2016, 28 (03) : 540 - 552