Two dimensional packing problem using a hybrid constructive algorithm of variable neighborhood search and simulated annealing
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 neighborho...
Main Authors: | Eliana Mirledy Toro, Alejandro Garcés, Hugo Ruiz |
---|---|
Format: | Article |
Language: | English |
Published: |
Universidad de Antioquia
2013-12-01
|
Series: | Revista Facultad de Ingeniería Universidad de Antioquia |
Subjects: | |
Online Access: | https://revistas.udea.edu.co/index.php/ingenieria/article/view/17935 |
Similar Items
-
Pattern Generation for Three Dimensional Cutting Stock Problem
by: Mutia Atika, et al.
Published: (2022-10-01) -
A Block Corner-Occupying Heuristic Algorithm for Constrained Two-Dimensional Guillotine Cutting Problem of Rectangular Items
by: Weiping Pan
Published: (2019-01-01) -
Formation of the Guillotine Cutting Card of a Sheet by the Guillotine Layout Functions
by: A.A. Andrianova, et al.
Published: (2017-06-01) -
Variable Neighborhood Search for the Two-Echelon Electric Vehicle Routing Problem with Time Windows
by: Mehmet Anıl Akbay, et al.
Published: (2022-01-01) -
Experimental validation of a reconfigurable guillotine shear and bending press machine
by: Ilesanmi Daniyan, et al.
Published: (2023-12-01)