The application of the distributed genetic algorithm to the decision of the packing in containers problem

In the paper a number of experiments on the solution of the task of packaging through a distributed genetic algorithm are surveyed. The way of coding of the genetic information and ratings of quality of solutions are written in detail. The outcomes of the comparative tests for the different configurations of operators of the genetic algorithm, sizes of a population and elitar block are surveyed; the best configurations are detected. The number of experiments on the definition of influence of topology of the distributed genetic algorithm, number of processors and period of migration on the quality of operation of the algorithm is given. The output of sufficient efficiency of the distributed genetic algorithm for the solution of the given type of tasks is made.