SOLUTIONS FOR BIN CUTTING & PACKAGING PROBLEM WITH A CONSTRUCTIVE AND NEURAL NETWORK APPROACH

Author(s): Korchevskaya Oksana Valerievna

Rubric: Information technology

Release: 2014-1 (4)

Pages: 142-149

Keywords: cutting tasks packaging optimization problems , NP- hard combinatorial optimization problems

Annotation: Formulation of the problem is presented n- dimensional packaging (n = 1, 2 , 3). A description of the method of planes for solving the three-dimensional packaging. Shows the composition of this method for two-dimensional packing problem. To determine the lower limits of problem solving cutting-packing machine used neural networks. Highly efficient algorithms for solving two- and three-dimensional cutting-packing , allowing to quickly build a nesting layout with a coefficient of cutting an average of 85%. The reliability of the results is confirmed by a comparative analysis of the dissertation of the existing approaches to solving the problem and the results of experimental data.

Bibliography: Korchevskaya OK.VA. SOLUTIONS FOR BIN CUTTING & PACKAGING PROBLEM WITH A CONSTRUCTIVE AND NEURAL NETWORK APPROACH // Education Resources and Technologies. – 2014. – № 1 (4). – С. 142-149. doi: