UNI-MB - logo
UMNIK - logo
 
(UL)
  • Experimental comparison of basic and cardinality constrained bin packing problem algorithms
    Remic, Maja, računalničarka ; Žerovnik, Gašper, fizik ; Žerovnik, Janez, 1958-
    Bin packing is an NP-hard optimization problem of packing items of a given sizes into minimum number of capacity-limited bins. Besides the basic problem, numerous other variants of bin packing ... exists. The cardinality constrained bin packing adds in additional constraint that the number of itemsin a bin must not exceed a given limit ▫$N_{max}$▫. The FFD, RFF and Zhang's bin packing problem algorithms are compared to the three cardinality constrained bin packing problem specific algorithms and random list of items with 0%, 10%, 30% and 50% of large items. The behaviour of all algorithms when ▫$N_{max}$▫ increases is also studied. Results show that all three specific algorithma outperform the general algorithms on lists with law percentage of big items. One of the specific algorithms performs better or equally even on lists with high percentage of big items and is therefore of significant interest. The behaviour when ▫$N_{max}$▫ increases shows that all three specific algorithms can be used for solving the general bin packing problem as well.
    Vir: SOR '11 proceedings (Str. 109-114)
    Vrsta gradiva - prispevek na konferenci
    Leto - 2010
    Jezik - angleški
    COBISS.SI-ID - 16048473

vir: SOR '11 proceedings (Str. 109-114)

loading ...
loading ...
loading ...