A Genetic Algorithm for the Nesting Problem With Continuous Rotations

被引：0
|
作者：
Nunes, Wesley H. B. [1 ]
Moreira, Mayron C. O. [1 ]
Andretta, Marina [2 ]
机构：
[1] Univ Fed Lavras, Dept Ciencia Comptacao, Lavras, Brazil
[2] Univ Sao Paulo, Dept Matemat Aplicada & Estat, Sao Carlos, SP, Brazil
来源：
2021 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC 2021) | 2021年
基金：
巴西圣保罗研究基金会;
关键词：
Nesting; Continuous Rotation; Heuristics;
D O I：
10.1109/CEC45853.2021.9504813
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
The Nesting problem, or the irregular cutting and packing problem, aims to find the best position of irregular pieces within a board, minimizing the space used by them. The problem's relevance is that it is widely used in the furniture, textile, and footwear industries. We consider a two-dimensional scope with convex and non-convex parts, with continuous rotation. We implement a genetic algorithm that uses five positioning rules, five sorting rules, and two rotation rules to create individuals and populations. Two positioning rules outperformed the others, obtaining promising results compared with the literature.
引用
收藏
页码：1107 / 1114
页数：8
相关论文
共 50 条
  • [41] Complex genetic algorithm in continuous space
    LI Qiang and ZHOU Ji Department of Mechanical Engineering
    CAD Center
    Chinese Science Bulletin, 1999, (10) : 954 - 960
  • [42] Complex genetic algorithm in continuous space
    Li, Q
    Zhou, J
    CHINESE SCIENCE BULLETIN, 1999, 44 (10): : 954 - U1
  • [43] Improved Knapsack Problem Algorithm based on Greedy Strategy for Tower Nesting
    Cai, Libin
    Wei, Shen
    Yuan, Jinghua
    Li, Li
    TRENDS IN CIVIL ENGINEERING, PTS 1-4, 2012, 446-449 : 592 - 595
  • [44] Improved double chains genetic algorithm for optimal searcher path problem in continuous time and space
    Zhang, Xian
    Ren, Yao-Feng
    Shen, Jing
    Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics, 2015, 37 (05): : 1092 - 1098
  • [45] A Solution Approach to The Problem of Nesting Rectangles with Arbitrary Rotations into Containers of Irregular Convex and Non-Convex Shapes
    Romanelli, Alexandre
    Amaral, Andre R. S.
    COMPUTATIONAL LOGISTICS, ICCL 2020, 2020, 12433 : 747 - 762
  • [46] Two-Dimensional Nesting System Based on Hybrid Genetic Algorithm
    WU Qingming
    WuhanUniversityJournalofNaturalSciences, 2009, 14 (01) : 60 - 64
  • [47] The Algorithm Animation of Genetic Algorithm of Travelling Salesman Problem
    Wen, Guozhi
    INFORMATION TECHNOLOGY APPLICATIONS IN INDUSTRY II, PTS 1-4, 2013, 411-414 : 2013 - 2016
  • [48] Improvements of Genetic Algorithm to the Knapsack Problem
    Zhang Haibo
    Cai Liwen
    Gao Shenyong
    Cheng Jianguo
    Yu Feng
    Li Daqing
    2010 THE 3RD INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND INDUSTRIAL APPLICATION (PACIIA2010), VOL I, 2010, : 126 - 128
  • [49] A genetic algorithm for the generalised assignment problem
    Wilson, JM
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1997, 48 (08) : 804 - 809
  • [50] A genetic algorithm for the multidimensional knapsack problem
    Chu, PC
    Beasley, JE
    JOURNAL OF HEURISTICS, 1998, 4 (01) : 63 - 86
12345