Bioinspired approach for 3D packaging problem

Abstract

The article deals with one of the most important optimization problems — the problem of three-dimensional packaging (3DP) of various sized elements. It belongs to the class of NP-hard and complex problems. The formulation and restrictions of the 3DPP are considered in the article. Bioinspired approach that uses a multi-level evolution and partially allows to avoid a preliminary convergence of algorithms. Genetic and evolutionary algorithms which obtain sets of quasi-optimal solutions in polynomial time were developed. To carry out computational experiments on test examples (benchmarks) the authors developed a software on the basis of bioinspired approach for the 3DPP. Conducted tests and experiments allow possible to clarify the theoretical estimations of algorithm time complexity. In the best case algorithms the time complexity is represented as O (n2), in the worst case — O (n3).