Exact fit problem generator for cutting and packing, revisiting of the upper deck placement algorithm

[1] R. Alvarez-Valdez, F. Parreño, J.M. Tamarit, A Tabu Search Algorithm for two-dimensional, non-quillotine problems, 2nd ESICUP Meeting, Southampton, England, 2005. ⇒ 74Search in Google Scholar

[2] H. David Mathias, R. Vincent, An empirical study of crossover and mass extinction in a genetic algorithm for pathfinding in a continuous environment, 2016 IEEE Congress on Evolutionary Computation (CEC), Vancouver, Canada, 2016, pp. 4111–4118. ⇒ 8110.1109/CEC.2016.7744312Search in Google Scholar

[3] E. Hopper, B. C. H. Turton, A genetic algorithm for a 2D industrial packing problem, Computers & Industrial Engineering37, (1999), 375–378. ⇒ 7710.1016/S0360-8352(99)00097-2Search in Google Scholar

[4] E. Hopper, B. C. H. Turton, An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem, European Journal of Operational Research128, 1 (2001) 34–57. ⇒ 7510.1016/S0377-2217(99)00357-4Search in Google Scholar

[5] L. Illyés, Genetic algorithms for a particular covering problem, International Conf. on Economic Cybernetics, Bucuresti, Romania, 2004. ⇒ 79, 82Search in Google Scholar

[6] L. Illyés, Upper Angle Placement Algorithm with Genetic Approach for 2D Rectangle Knapsack Problem, 2nd ESICUP Meeting, Southampton, England, 2005. ⇒ 74, 77, 78Search in Google Scholar

[7] L. Illyés, Cs. Fábián, “Jigsaw” problem generator for 2D rectangle single large object for non-guillotine and guillotine cutting, Proc. WSCSP2005, Workshop on Cutting Stock Problems, Miercurea-Ciuc, Romania, 2005, pp. 83–89. ⇒ 74Search in Google Scholar

[8] L. Illyés, L. Pál, Generalized particular covering problem with genetic algorithms, AMO - Advanced Modeling and Optimization, 7, 1, 2005, 1–7. ⇒ 79, 82Search in Google Scholar

[9] T. Inamichi et. al., Branch-and-bound algorithms for regular strip packing and perfect packing problems, 2nd ESICUP Meeting, Southampton, England, 2005. ⇒ 74Search in Google Scholar

[10] S. Jakobs, On genetic algorithms for packing polygons, European Journal of Operational Research88, (1996), 165–181. ⇒ 74Search in Google Scholar

[11] B. Jaworski, Kuczkowski, R. Śmierzchalski, Extinction Event Concepts for the Evolutionary Algorithms, Przeglad Elektrotechniczny, 1, 88 (2012), 252–255. ⇒ 81Search in Google Scholar

[12] D. Liu, H. Teng, An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles, European Journal of Operational Research112, (1999), 413–420. ⇒ 75Search in Google Scholar

[13] C. L. Mumford, P. Y. Wang, A genetic simulated annealig approach to aacking, 2nd ESICUP Meeting, Southampton, England, 2005. ⇒ 74Search in Google Scholar

[14] E. Silva, J. F. Oliveira, G. Wäsher, A problem generator for two-dimensional rectangular cutting and packing problems, ESICUP. (2007), https://paginas.fe.up.pt/~esicup/problem_generators. ⇒ 74Search in Google Scholar

[15] M. Villalobos-Arias, C. Coello Coello, O. Hernndez-Lerma, Asymptotic convergence of some metaheuristics used for multiobjective optimization, FOGA 2005: Foundations of Genetic Algorithms, Aizu-Wakamatsu, Japan, 2005, pp. 95–111. ⇒ 8010.1007/11513575_6Search in Google Scholar

[16] G. Wäscher, H. Hauner, H. Schumann, An improved typology of cutting and packing problems, European Journal of Operational Research183, 3 (2007), 1109–1130. ⇒ 7410.1016/j.ejor.2005.12.047Search in Google Scholar

[17] EURO Special Interest Group on Cutting and Packing, https://paginas.fe.up.pt/~esicup/problem_generators ⇒ 74Search in Google Scholar