APPLICATION OF GENETIC ALGORITHM TO THREE-DIMENSIONAL PACKAGING PROBLEM
Every time when it is needed to place items in stock or get into a vehicle, there is a problem to load items as close as possible. The problem of load (knapsack problem) and its various modifications are widely used in practice in mathematics, cryptography, economics, logistics, and to find a solution to optimal loading of different vehicles: airplanes, ships, rail cars, etc. In this paper we propose an algorithm for calculating the optimal stowage in the vehicles. It allows to fill cargo with a high degree of adaptability to the constraints arising in practice.