2019•International Journal of Services and Operations ManagementRequires access
Element-capacity difference algorithm for optimal bin packing
Deep Shah, A. Aakash, R. Vimal Samsingh
Open publisher page 0 citations
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.