IDEAS home Printed from https://ideas.repec.org/a/ids/ijsoma/v34y2019i1p21-32.html
   My bibliography  Save this article

Element-capacity difference algorithm for optimal bin packing

Author

Listed:
  • Deep Shah
  • A. Aakash
  • R. Vimal Samsingh

Abstract

In this paper, the NP-complete problem of 1D bin packing is considered. In the 'bin packing problem', a set of numbers or elements that need to be loaded in the bins is considered. The total load of the elements in any bin must not exceed the bin size or bin capacity. These elements must be packed or loaded in the bins in such a way that there is minimum amount of space left in each bin and the number of bins to be used is minimised. A new algorithm, which helps in tackling the bin packing problem, by giving optimal solutions in minimum time, is presented. The algorithms currently in use, requires the elements to be sorted before the loading. The algorithm discussed in this paper avoids the sorting operation before the loading while giving the same best fit results.

Suggested Citation

  • Deep Shah & A. Aakash & R. Vimal Samsingh, 2019. "Element-capacity difference algorithm for optimal bin packing," International Journal of Services and Operations Management, Inderscience Enterprises Ltd, vol. 34(1), pages 21-32.
    • Handle: RePEc:ids:ijsoma:v:34:y:2019:i:1:p:21-32
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=102029
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:ids:ijsoma:v:34:y:2019:i:1:p:21-32. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=150 .

    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.