A Hybrid Biased Random Key Genetic Algorithm for a Production and Cutting Problem

被引:3
|
作者
Goncalves, Jose Fernando [1 ]
机构
[1] Univ Porto, Fac Econ, INESC TEC, LIAAD, Rua Campo Alegre 823, P-4100 Oporto, Portugal
来源
IFAC PAPERSONLINE | 2015年 / 48卷 / 03期
关键词
Biased random-key genetic algorithm; Cutting pattern; Cutting problem; Sequential heuristic procedure; random-keys; PACKING PROBLEMS;
D O I
10.1016/j.ifacol.2015.06.130
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper deals with a very common problem in the home-textile industry. Given a set of orders of small rectangles of fabric the problem consists of determining the lengths and widths of a set of large rectangles of fabric to be produced and the corresponding cutting patterns. The objective is to minimize the total quantity of fabric necessary to satisfy all orders. The approach proposed uses a biased random-key genetic algorithm for generating sets of cutting patterns which are the input to a sequential heuristic procedure which generates a solution. Experimental tests based on a set of 100 random generated problems with known optimal solution validate quality of the approach. (C) 2013, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved,
引用
收藏
页码:496 / 500
页数:5
相关论文
共 50 条
  • [31] A biased random-key genetic algorithm for the maximum quasi-clique problem
    Pinto, Bruno Q.
    Ribeiro, Celso C.
    Rosseti, Isabel
    Plastino, Alexandre
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 271 (03) : 849 - 865
  • [32] A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
    Ruiz, Efrain
    Albareda-Sambola, Maria
    Fernandez, Elena
    Resende, Mauricio G. C.
    COMPUTERS & OPERATIONS RESEARCH, 2015, 57 : 95 - 108
  • [33] A biased random-key genetic algorithm for the rescue unit allocation and scheduling problem
    Cunha, Victor
    Pessoa, Luciana
    Vellasco, Marley
    Tanscheit, Ricardo
    Pacheco, Marco Aurelio
    2018 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2018, : 1439 - 1444
  • [34] A biased random-key genetic algorithm for the project scheduling problem with flexible resources
    Bernardo F. Almeida
    Isabel Correia
    Francisco Saldanha-da-Gama
    TOP, 2018, 26 : 283 - 308
  • [35] A biased random-key genetic algorithm for the container pre-marshalling problem
    Hottung, Andre
    Tierney, Kevin
    COMPUTERS & OPERATIONS RESEARCH, 2016, 75 : 83 - 102
  • [36] Biased Random Key Genetic Algorithm with Hybrid Decoding for Multi-objective Optimization
    Tangpattanakul, Panwadee
    Jozefowiez, Nicolas
    Lopez, Pierre
    2013 FEDERATED CONFERENCE ON COMPUTER SCIENCE AND INFORMATION SYSTEMS (FEDCSIS), 2013, : 393 - 400
  • [37] A multistart biased random key genetic algorithm for the flexible job shop scheduling problem with transportation
    Homayouni, S. Mahdi
    Fontes, Dalila B. M. M.
    Goncalves, Jose F.
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2023, 30 (02) : 688 - 716
  • [38] Biased Random-Key Genetic Algorithm with Local Search Applied to the Maximum Diversity Problem
    Silva, Geiza
    Leite, Andre
    Ospina, Raydonal
    Leiva, Victor
    Figueroa-Zuniga, Jorge
    Castro, Cecilia
    MATHEMATICS, 2023, 11 (14)
  • [39] A biased random-key genetic algorithm for the minimum quasi-clique partitioning problem
    Melo, Rafael A.
    Ribeiro, Celso C.
    Riveaux, Jose A.
    ANNALS OF OPERATIONS RESEARCH, 2023,
  • [40] A Biased Random Key Genetic Algorithm with Rollout Evaluations for the Resource Constraint Job Scheduling Problem
    Blum, Christian
    Thiruvady, Dhananjay
    Ernst, Andreas T.
    Horn, Matthias
    Raidl, Gunther R.
    AI 2019: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2019, 11919 : 549 - 560