New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation

2007 ◽  
Vol 34 (8) ◽  
pp. 2223-2250 ◽  
Author(s):  
Jacques Carlier ◽  
François Clautiaux ◽  
Aziz Moukrim
Keyword(s):  
Lower Bounds ◽  
Bin Packing ◽  
Packing Problem ◽  
Two Dimensional ◽  
Bin Packing Problem ◽  
Fixed Orientation

A new exact method for the two-dimensional bin-packing problem with fixed orientation

2007 ◽  
Vol 35 (3) ◽  
pp. 357-364 ◽  
Author(s):  
François Clautiaux ◽  
Jacques Carlier ◽  
Aziz Moukrim
Keyword(s):  
Bin Packing ◽  
Packing Problem ◽  
Exact Method ◽  
Two Dimensional ◽  
Bin Packing Problem ◽  
Fixed Orientation

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.

scholarly journals A Binary Crow Search Algorithm for Solving Two-dimensional Bin Packing Problem with Fixed Orientation

2020 ◽  
Vol 167 ◽  
pp. 809-818 ◽  
Author(s):  
Soukaina Laabadi ◽  
Mohamed Naimi ◽  
Hassan El Amri ◽  
Boujemâa Achchab
Keyword(s):  
Bin Packing ◽  
Search Algorithm ◽  
Packing Problem ◽  
Two Dimensional ◽  
Bin Packing Problem ◽  
Fixed Orientation

A new lower bound for the non-oriented two-dimensional bin-packing problem

2007 ◽  
Vol 35 (3) ◽  
pp. 365-373 ◽  
Author(s):  
François Clautiaux ◽  
Antoine Jouglet ◽  
Joseph El Hayek
Keyword(s):  
Lower Bound ◽  
Bin Packing ◽  
Packing Problem ◽  
Two Dimensional ◽  
Bin Packing Problem
Sign in / Sign up

Export Citation Format

Share Document