Ranking lower bounds for the bin-packing problem

2005 ◽  
Vol 160 (1) ◽  
pp. 34-46 ◽  
Author(s):  
Samir Elhedhli
Keyword(s):  
Lower Bounds ◽  
Bin Packing ◽  
Packing Problem ◽  
Bin Packing Problem

Efficient lower bounds and heuristics for the variable cost and size bin packing problem

2011 ◽  
Vol 38 (11) ◽  
pp. 1474-1482 ◽  
Author(s):  
Teodor Gabriel Crainic ◽  
Guido Perboli ◽  
Walter Rei ◽  
Roberto Tadei
Keyword(s):  
Lower Bounds ◽  
Bin Packing ◽  
Packing Problem ◽  
Variable Cost ◽  
Bin Packing Problem

A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem

2018 ◽  
Vol 52 (2) ◽  
pp. 391-414 ◽  
Author(s):  
Mehdi Serairi ◽  
Mohamed Haouari
Keyword(s):  
Lower Bounds ◽  
Bin Packing ◽  
Computational Study ◽  
Packing Problem ◽  
Large Set ◽  
Two Dimensional ◽  
Bin Packing Problem ◽  
Benchmark Instances ◽  
Empirical Performance ◽  
Minimum Number

We address the two-dimensional bin packing problem with fixed orientation. This problem requires packing a set of small rectangular items into a minimum number of standard two-dimensional bins. It is a notoriously intractable combinatorial optimization problem and has numerous applications in packing and cutting. The contribution of this paper is twofold. First, we propose a comprehensive theoretical analysis of lower bounds and we elucidate dominance relationships. We show that a previously presented dominance result is incorrect. Second, we present the results of an extensive computational study that was carried out, on a large set of 500 benchmark instances, to assess the empirical performance of the lower bounds. We found that the so-called Carlier-Clautiaux-Moukrim lower bounds exhibits an excellent relative performance and yields the tightest value for all of the benchmark instances.

Sign in / Sign up

Export Citation Format

Share Document