Abstract
A class of genetic algorithms for solving the 2D Strip Packing Problem is investigated. The theoretical analysis of the complexity of implementing decoders MERA and BLF is done. Original implementations of these MERA and BLF decoders enhanced with a number of heuristic optimizations are proposed. Genetic algorithm for solving the 2D Strip Packing Problem for special cases (allowed/forbidden objects rotation by 90°) with the use of MERA/BLF decoders is proposed. Extensive computational experiments with well-known instances are performed to analyze different configurations of basic parameters of proposed genetic algorithm. The comparison of the obtained algorithm with other known algorithms is given.
Publisher
National Academy of Sciences of Ukraine (Co. LTD Ukrinformnauka)
Reference17 articles.
1. 1. Stoyan Y.G., Yakovlev S.V. Mathematical models and optimization methods of the geometric projection. - Kiev: Scientific thought. - 1986. - 268 p.
2. 2. Glibovets M.M., Gulayeva N.M. Evolutionary algorithms: a textbook. - NaUKMA, 2013. - P. 334-357.
3. 3. Mukhacheva E.A., Mukhacheva A.S. L.V. Kantorovich and problems of cutting-package, new approaches to combinatorial problems of linear cutting and rectangular package // Notes of POMI scientific seminars. - 2004. - Vol. 312. - P. 239-255.
4. 4. Fowler R.J., Paterson M.S., Tatimoto S.L. Optimal packing and covering in the plane are NP-complete // Information Processing Letters. - 1981 - N 12. - P. 133-137.
5. 5. Grebennik I.V., Pankratov A.V., Chugai A.M., Baranov A.V. Packaging n-dimensional parallelepipeds with the ability to change their orthogonal orientation in n-dimensional parallelepiped // Cybernetics and Systems Analysis. - 2010. - N 5. - P. 122-131.