A Tighter Lower Bound for Optimal Bin Packing
نویسندگان
چکیده
In this paper, we present an O(n1ogn) algorithm to compute a tighter lower bound for the one-dimensional bin packing problem. We have simulated the algorithm on randomly generated bin packing problems with item sizes drawn uniformly from (a, b], where 0 5 a < b 5 B and B is bin size. Using our lower bound, the average error of BFD is less than 2%. For a + b > B, the error is less than 0.003%. Key w0rd.s: bin packing, lower bound, best fit decreasing, harmonic partition, matching.
منابع مشابه
Extending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items
In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...
متن کاملA tight lower bound for optimal bin packing
In this paper, we present an eecient algorithm to compute a tighter lower bound for the one-dimensional bin packing problem. The time complexity of the algorithm is O(n log n). We have simulated the algorithm on randomly generated bin packing problems with item sizes drawn uniformly from (a; b], 0 a < b B. If our lower bound is used, on average, the error of BFD is less than 2%. For a + b B, th...
متن کاملA Tighter Lower Bound for 1-D Bin-Packing
For NP-complete problems, it may not be possible to find an optimal solution in polynomial time. However, efficient approximation algorithms for many NP-complete problems do exist. A good approach is to find tighter upper and lower bounds on the optimal solutions. As the gap between these two bounds approaches zero, optimality is reached. For minimization problems, any feasible solution serves ...
متن کاملAn 8/3 Lower Bound for Online Dynamic Bin Packing
We study the dynamic bin packing problem introduced by Coffman, Garey and Johnson. This problem is a generalization of the bin packing problem in which items may arrive and depart dynamically. The objective is to minimize the maximum number of bins used over all time. The main result is a lower bound of 8/3 ∼ 2.666 on the achievable competitive ratio, improving the best known 2.5 lower bound. T...
متن کاملBest-fit Bin-packing with Random Order Ecole Normale Supérieure De Lyon Best-fit Bin-packing with Random Order Best-fit Bin-packing with Random Order
Best t is the best known algorithm for on line bin packing in the sense that no algorithm is known to behave better both in the worst case and in the average uniform case In practice Best t appears to perform within a few percent of optimal In this paper we study the expected performance ratio taking the worst case multiset of items L and assuming that the elements of L are inserted in random o...
متن کامل