Parallel packing procedure for three dimensional bin packing problem

The paper proposes an algorithm for parallel packing procedure for three-dimensional packing problem. In the considered variant of the problem the load of the biggest capacity is placed inside the container with permanent dimensions. In order to parallelize computations there was CUDA technology used which enables running of independent computing threads with the use of graphic card cores. The obtained results prove the validity of the assumptions, particularly for large instances of the problem.