Bin packing problem belongs to the class of optimization problems, which has wide application in various fields, including packing, placement, etc. In this paper we describe several algorithms that solve variable sized Bin packing problem: Algorithm based on the Subset problem, Algorithm basd on the One-dimensional Bin packing problem and Genethic algorithm. Explanations and implementations are given. Also, we present the results of testing efficiency of algorithms.

Keywords: Бин пацкинг алгоритам, генетски алгоритам, оптимизација
Published on website: 7.5.2012