| Abstract [eng] |
Bin packing problem is classic optimization problem. This problem is interesting not only theoretically, but also has many practical applications. F. e. placing articles in newspaper so that the amount of papers would be minimal. Or putting boxes in trucks so that the amount of trucks would be minimal. “Nvidia” perfected their CUDA technology which allows to perform a large amount of computation using graphics processing unit. Graphics processing unit is adapted to perform the same actions with different data many times, and that is exactly what bin packing problem is all about. This work is focused on solving two-dimensional bin packing problem where objects cannot be rotated, objects are rectangular shape, objects are given offline and all bins are same dimensions. CUDA will also be used to address this challenge in parallel. An evolutionary heuristic algorithm which applies modifications is presented as well. Finally, experiment for measuring the speed and accuracy of the proposed algorithm are presented, as well as the results obtained. |
