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
基金
巴西圣保罗研究基金会;
关键词
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 条
  • [21] Genetic Algorithms to the Nesting Problem in the Leather Manufacturing Industry
    张玉萍
    蒋寿伟
    尹忠慰
    Journal of DongHua University, 2005, (01) : 90 - 96
  • [22] A Variable Neighborhood Search Algorithm for the Leather Nesting Problem
    Alves, Claudio
    Bras, Pedro
    Valerio de Carvalho, Jose M.
    Pinto, Telmo
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2012, 2012
  • [23] A pairwise exact placement algorithm for the irregular nesting problem
    Sato, Andre Kubagawa
    Martins, Thiago de Castro
    Guerra Tsuzuki, Marcos de Sales
    INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING, 2016, 29 (11) : 1177 - 1189
  • [24] A Multi-Objective Continuous Genetic Algorithm for Financial Portfolio Optimization Problem
    Kessaci, Yacine
    PROCEEDINGS OF THE 2017 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE COMPANION (GECCO'17 COMPANION), 2017, : 151 - 152
  • [25] Analysis of the continuous berth allocation problem in container ports using a genetic algorithm
    S. R. Seyedalizadeh Ganji
    A. Babazadeh
    N. Arabshahi
    Journal of Marine Science and Technology, 2010, 15 : 408 - 416
  • [26] Study on continuous network design problem using simulated annealing and genetic algorithm
    Xu, Tianze
    Wei, Heng
    Wang, Zhuan-De
    EXPERT SYSTEMS WITH APPLICATIONS, 2009, 36 (02) : 2735 - 2741
  • [27] Application of continuous parameter genetic algorithm to the problem of synthesizing bandpass distributed amplifiers
    Günel, T
    Aydemir, ME
    AEU-INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATIONS, 2002, 56 (05) : 351 - 354
  • [28] A genetic algorithm based approach for the uncapacitated continuous location-allocation problem
    Salhi, S
    Gamal, NDH
    ANNALS OF OPERATIONS RESEARCH, 2003, 123 (1-4) : 203 - 222
  • [29] Analysis of the continuous berth allocation problem in container ports using a genetic algorithm
    Ganji, S. R. Seyedalizadeh
    Babazadeh, A.
    Arabshahi, N.
    JOURNAL OF MARINE SCIENCE AND TECHNOLOGY, 2010, 15 (04) : 408 - 416
  • [30] Solving unit commitment problem by combining of continuous relaxation method and genetic algorithm
    Tokoro, Ken-ichi
    Masuda, Yasushi
    Nishino, Hisakazu
    2008 PROCEEDINGS OF SICE ANNUAL CONFERENCE, VOLS 1-7, 2008, : 3323 - +