IDEAS home Printed from https://ideas.repec.org/a/bit/bsrysr/v3y2012i2p57-63.html
   My bibliography  Save this article

An experimental comparison of some heuristics for cardinality constrained bin packing problem

Author

Listed:
  • Remic Maja

    (University of Ljubljana, Ljubljana, Slovenia)

  • Žerovnik Gašper

    (Reactor Physics Division, Jožef Stefan Institute, Ljubljana, Slovenia)

  • Žerovnik Janez

    (Faculty for Mechanical Engineering, University of Ljubljana, Ljubljana, Slovenia)

Abstract

Background: Bin packing is an NPhard optimization problem of packing items of given sizes into minimum number of capacitylimited bins. Besides the basic problem, numerous other variants of bin packing exist. The cardinality constrained bin packing adds an additional constraint that the number of items in a bin must not exceed a given limit Nmax. Objectives: Goal of the paper is to present a preliminary experimental study which demostrates adaptations of the new algorithms to the general cardinality constrained bin packing problem. Methods/Approach: Straightforward modifications of First Fit Decreasing (FFD), Refined First Fit (RFF) and the algorithm by Zhang et al. for the bin packing problem are compared to four cardinality constrained bin packing problem specific algorithms on random lists of items with 0%, 10%, 30% and 50% of large items. The behaviour of all algorithms when cardinality constraint Nmax increases is also studied. Results: Results show that all specific algorithms outperform the general algorithms on lists with low percentage of big items. Conclusions: One of the specific algorithms performs better or equally well even on lists with high percentage of big items and is therefore of significant interest. The behaviour when Nmax increases shows that specific algorithms can be used for solving the general bin packing problem as well.

Suggested Citation

  • Remic Maja & Žerovnik Gašper & Žerovnik Janez, 2012. "An experimental comparison of some heuristics for cardinality constrained bin packing problem," Business Systems Research, Sciendo, vol. 3(2), pages 57-63, September.
    • Handle: RePEc:bit:bsrysr:v:3:y:2012:i:2:p:57-63
    DOI: 10.2478/v10305-012-0013-1
    as

    Download full text from publisher

    File URL: https://doi.org/10.2478/v10305-012-0013-1
    Download Restriction: no
    File URL: https://libkey.io/10.2478/v10305-012-0013-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bit:bsrysr:v:3:y:2012:i:2:p:57-63. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Peter Golla (email available below). General contact details of provider: https://www.sciendo.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.