A best-fit heuristic algorithm for two-dimensional bin packing problem

Author(s):  
Dayong Cao ◽  
V. M. Kotov
2007 ◽  
Vol 35 (3) ◽  
pp. 365-373 ◽  
Author(s):  
François Clautiaux ◽  
Antoine Jouglet ◽  
Joseph El Hayek

2007 ◽  
Vol 35 (3) ◽  
pp. 357-364 ◽  
Author(s):  
François Clautiaux ◽  
Jacques Carlier ◽  
Aziz Moukrim

Computing ◽  
1987 ◽  
Vol 39 (3) ◽  
pp. 201-217 ◽  
Author(s):  
J. B. G. Frenk ◽  
G. Galambos

Author(s):  
Aida Kenza Amara ◽  
Bachir Djebbar

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