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: | , , |
|---|---|
| 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 |
| _version_ | 1797861727192219648 |
|---|---|
| author | Eliana Mirledy Toro Alejandro Garcés Hugo Ruiz |
| author_facet | Eliana Mirledy Toro Alejandro Garcés Hugo Ruiz |
| author_sort | Eliana Mirledy Toro |
| collection | DOAJ |
| description |
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.
|
| first_indexed | 2024-04-09T22:08:53Z |
| format | Article |
| id | doaj.art-f1b95d803df6403c9c058f3232a7552a |
| institution | Directory Open Access Journal |
| issn | 0120-6230 2422-2844 |
| language | English |
| last_indexed | 2024-04-09T22:08:53Z |
| publishDate | 2013-12-01 |
| publisher | Universidad de Antioquia |
| record_format | Article |
| series | Revista Facultad de Ingeniería Universidad de Antioquia |
| spelling | doaj.art-f1b95d803df6403c9c058f3232a7552a2023-03-23T12:33:45ZengUniversidad de AntioquiaRevista Facultad de Ingeniería Universidad de Antioquia0120-62302422-28442013-12-014610.17533/udea.redin.17935Two dimensional packing problem using a hybrid constructive algorithm of variable neighborhood search and simulated annealingEliana Mirledy Toro0Alejandro Garcés1Hugo Ruiz 2Universidad Tecnológica de PereiraUniversidad Tecnológica de PereiraUniversidad Tecnológica de Pereira 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. https://revistas.udea.edu.co/index.php/ingenieria/article/view/17935Guillotinetwo-dimensional cuttingvariable neighborhood searchoptimization |
| spellingShingle | Eliana Mirledy Toro Alejandro Garcés Hugo Ruiz Two dimensional packing problem using a hybrid constructive algorithm of variable neighborhood search and simulated annealing Revista Facultad de Ingeniería Universidad de Antioquia Guillotine two-dimensional cutting variable neighborhood search optimization |
| title | Two dimensional packing problem using a hybrid constructive algorithm of variable neighborhood search and simulated annealing |
| title_full | Two dimensional packing problem using a hybrid constructive algorithm of variable neighborhood search and simulated annealing |
| title_fullStr | Two dimensional packing problem using a hybrid constructive algorithm of variable neighborhood search and simulated annealing |
| title_full_unstemmed | Two dimensional packing problem using a hybrid constructive algorithm of variable neighborhood search and simulated annealing |
| title_short | Two dimensional packing problem using a hybrid constructive algorithm of variable neighborhood search and simulated annealing |
| title_sort | two dimensional packing problem using a hybrid constructive algorithm of variable neighborhood search and simulated annealing |
| topic | Guillotine two-dimensional cutting variable neighborhood search optimization |
| url | https://revistas.udea.edu.co/index.php/ingenieria/article/view/17935 |
| work_keys_str_mv | AT elianamirledytoro twodimensionalpackingproblemusingahybridconstructivealgorithmofvariableneighborhoodsearchandsimulatedannealing AT alejandrogarces twodimensionalpackingproblemusingahybridconstructivealgorithmofvariableneighborhoodsearchandsimulatedannealing AT hugoruiz twodimensionalpackingproblemusingahybridconstructivealgorithmofvariableneighborhoodsearchandsimulatedannealing |