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

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

scholarly journals Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem

Computing ◽  
1987 ◽  
Vol 39 (3) ◽  
pp. 201-217 ◽  
Author(s):  
J. B. G. Frenk ◽  
G. Galambos
Keyword(s):  
Bin Packing ◽  
Packing Problem ◽  
Two Dimensional ◽  
Bin Packing Problem

New Pretreatment and Resolution Using the Bee Colony Optimization for the Two-Dimensional Bin Packing Problem

2016 ◽  
Vol 14 ◽  
pp. 13-22
Author(s):  
Aida Kenza Amara ◽  
Bachir Djebbar
Keyword(s):  
Bin Packing ◽  
Heuristic Method ◽  
Packing Problem ◽  
Computational Results ◽  
Two Dimensional ◽  
Bee Colony ◽  
Bin Packing Problem ◽  
Bee Colony Optimization ◽  
Minimum Number

The two-dimensional bin packing problem involves packing a given set of rectangles into a minimum number of larger identical rectangles called bins. In this paper, we propose and develop mathematically a new pretreatment for the oriented version of the problem in order to reduce its size, identify and value the lost spaces by increasing the size of some objects. A heuristic method based on the first-fit strategy adapted to this problem is proposed. We present an approach of resolution using the bee colony optimization. The computational results show the effectiveness of the pretreatment in reducing the number of bins.

Sign in / Sign up

Export Citation Format

Share Document