Two dimensional packing problem using a hybrid constructive algorithm of variable neighborhood search and simulated annealing

被引：0
|
作者：
Toro, Eliana Mirledy [1 ]
Garces, Alejandro [1 ]
Ruiz, Hugo [2 ]
机构：
[1] Univ Tecnol Pereira, Fac Ingn Ind, Risaralda, Colombia
[2] Univ Tecnol Pereira, Programa Ingn Elect, Risaralda, Colombia
来源：
REVISTA FACULTAD DE INGENIERIA-UNIVERSIDAD DE ANTIOQUIA | 2008年 / 46期
关键词：
Guillotine; two-dimensional cutting; variable neighborhood search; optimization;
D O I：
暂无
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
In this work, the packing of rectangles is modeled based on divisions of the available area, a binary tree codification is used to arrange the pieces so that the guillotines type cutting is guaranteed. A three stages algorithm with individual strategies inspired by algorithms of variable neighborhood search simulated annealing and constructive techniques are used to obtain the solution of the problem. The results obtained are compared using the objective function and percentage used of available area with fifty test cases of the specialized literature and their respective well-known answer with excellent results.
引用
收藏
页码：119 / 131
页数：13
相关论文
共 50 条
  • [1] A variable neighborhood search and simulated annealing hybrid for the profile minimization problem
    Palubeckis, Gintaras
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2017, 87 : 83 - 97
  • [2] A hybrid simulated-annealing algorithm for two-dimensional strip packing problem
    Dereli, Turkay
    Das, Guiesin Sena
    [J]. ADAPTIVE AND NATURAL COMPUTING ALGORITHMS, PT 1, 2007, 4431 : 508 - +
  • [3] A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
    Leung, Stephen C. H.
    Zhang, Defu
    Zhou, Changle
    Wu, Tao
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (01) : 64 - 73
  • [4] Hybrid imperialist competitive algorithm, variable neighborhood search, and simulated annealing for dynamic facility layout problem
    Seyedmohsen Hosseini
    Abdullah Al Khaled
    Satish Vadlamani
    [J]. Neural Computing and Applications, 2014, 25 : 1871 - 1885
  • [5] Hybrid imperialist competitive algorithm, variable neighborhood search, and simulated annealing for dynamic facility layout problem
    Hosseini, Seyedmohsen
    Al Khaled, Abdullah
    Vadlamani, Satish
    [J]. NEURAL COMPUTING & APPLICATIONS, 2014, 25 (7-8): : 1871 - 1885
  • [6] A hybrid simulated annealing and variable neighborhood search algorithm for the close-open electric vehicle routing problem
    Stamadianos, Themistoklis
    Kyriakakis, Nikolaos A.
    Marinaki, Magdalene
    Marinakis, Yannis
    [J]. ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2023,
  • [7] A hybrid variable neighborhood search and simulated annealing algorithm to estimate the three parameters of the Weibull distribution
    Abbasi, Babak
    Niaki, Seyed Taghi Akhavan
    Khalife, Mehrzad Abdi
    Faize, Yasser
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (01) : 700 - 708
  • [8] Simulated Annealing and Variable Neighborhood Search Hybrid Metaheuristic for the Geographic Clustering
    Bernabe Loranca, Maria Beatriz
    Pinto Avendano, David
    Olivares Benitez, Elias
    Ramirez Rodriguez, Javier
    Martinez Flores, Jose Luis
    [J]. PROCEEDINGS OF THE FOURTH INTERNATIONAL WORKSHOP ON KNOWLEDGE DISCOVERY, KNOWLEDGE MANAGEMENT AND DECISION SUPPORT (EUREKA-2013), 2013, 51 : 140 - 147
  • [9] A variable neighborhood search algorithm for the bin packing problem with compatible categories
    Moura Santos, Luiz F. O.
    Iwayama, Renan Sallai
    Cavalcanti, Luisa Brandao
    Turi, Leandro Maciel
    de Souza Morais, Fabio Emanuel
    Mormilho, Gabriel
    Cunha, Claudio B.
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2019, 124 : 209 - 225
  • [10] Hybrid Variable Neighborhood and Simulated Annealing Heuristic Algorithm to Solve RCPSP
    Carlos Rivera, Juan
    Josefina Celin, Ana
    [J]. REVISTA FACULTAD DE INGENIERIA-UNIVERSIDAD DE ANTIOQUIA, 2010, (56): : 255 - 267
12345