New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems

2010 ◽  
Vol 203 (2) ◽  
pp. 306-315 ◽  
Author(s):  
Frank G. Ortmann ◽  
Nthabiseng Ntene ◽  
Jan H. van Vuuren
Keyword(s):  
Bin Packing ◽  
Strip Packing ◽  
Packing Problems ◽  
Rectangular Strip

scholarly journals A STRIP PACKING SOLVING METHOD USING AN INCREMENTAL MOVE BASED ON MAXIMAL HOLES

2008 ◽  
Vol 17 (05) ◽  
pp. 881-901 ◽  
Author(s):  
BERTRAND NEVEU ◽  
GILLES TROMBETTONI ◽  
IGNACIO ARAYA ◽  
MARIA-CRISTINA RIFF
Keyword(s):  
Local Search ◽  
Bin Packing ◽  
Packing Problem ◽  
Experimental Results ◽  
Greedy Heuristics ◽  
Strip Packing ◽  
Packing Problems ◽  
Alternative Approach ◽  
Bottom Left ◽  
Complete Optimization

When handling 2D packing problems, numerous incomplete and complete algorithms maintain a so-called bottom-left (BL) property: no rectangle placed in a container can be moved more left or bottom. While it is easy to make a rectangle BL when it is added in a container, it is more expensive to maintain all the placed pieces BL when a rectangle is removed. This prevents researchers from designing incremental moves for metaheuristics or efficient complete optimization algorithms. This paper investigates the possibility of violating the BL property. Instead, we propose to maintain the set of maximal holes, which allows incremental additions and removals of rectangles. To validate our alternative approach, we have designed an incremental move, maintaining maximal holes, for the strip packing problem, a variant of the famous 2D bin-packing. We have also implemented a metaheuristic, with no user-defined parameter, using this move and standard greedy heuristics. We have finally designed two variants of this incomplete method. In the first variant, a better first layout is provided by a hyperheuristic proposed by some of the authors. In the second variant, a fast repacking procedure recovering the BL property is occasionally called during the local search. Experimental results show that the approach is competitive with the best known incomplete algorithms.

scholarly journals Bin Packing Problems with Uncertainty on Item Characteristics: An Application to Capacity Planning in Logistics

2014 ◽  
Vol 111 ◽  
pp. 654-662 ◽  
Author(s):  
Teodor Gabriel Crainic ◽  
Luca Gobbato ◽  
Guido Perboli ◽  
Walter Rei ◽  
Jean-Paul Watson ◽  
...  
Keyword(s):  
Capacity Planning ◽  
Bin Packing ◽  
Packing Problems ◽  
Item Characteristics

scholarly journals Generalized Bin Packing Problems

4OR ◽  
2013 ◽  
Vol 12 (3) ◽  
pp. 293-294 ◽  
Author(s):  
Mauro Maria Baldi
Keyword(s):  
Bin Packing ◽  
Packing Problems

Heuristics for Two-Dimensional Bin-Packing Problems

2018 ◽  
pp. 27-1-27-18
Author(s):  
Tak Ming Chan ◽  
Filipe Alvelos ◽  
Elsa Silva ◽  
J.M. Valério de Carvalho
Keyword(s):  
Bin Packing ◽  
Two Dimensional ◽  
Packing Problems
Sign in / Sign up

Export Citation Format

Share Document