scholarly journals Heuristics for Large Strip Packing Problems with Guillotine Patterns: An Empirical Study

Author(s):  
Christine L. Mumford-Valenzuela ◽  
Janis Vick ◽  
Pearl Y. Wang
2013 ◽  
Vol 48 ◽  
pp. 312-324 ◽  
Author(s):  
Kyung Tae Park ◽  
Hansol Kim ◽  
Soobin Lee ◽  
Ho-Kyung Lee ◽  
Jun-hyung Ryu ◽  
...  

2017 ◽  
Vol 2017 ◽  
pp. 1-11 ◽  
Author(s):  
Bonfim Amaro Júnior ◽  
Plácido Rogério Pinheiro ◽  
Pedro Veras Coelho

The irregular strip packing problem (ISPP) is a class of cutting and packing problem (C&P) in which a set of items with arbitrary formats must be placed in a container with a variable length. The aim of this work is to minimize the area needed to accommodate the given demand. ISPP is present in various types of industries from manufacturers to exporters (e.g., shipbuilding, clothes, and glass). In this paper, we propose a parallel Biased Random-Key Genetic Algorithm (µ-BRKGA) with multiple populations for the ISPP by applying a collision-free region (CFR) concept as the positioning method, in order to obtain an efficient and fast layout solution. The layout problem for the proposed algorithm is represented by the placement order into the container and the corresponding orientation. In order to evaluate the proposed (µ-BRKGA) algorithm, computational tests using benchmark problems were applied, analyzed, and compared with different approaches.


Author(s):  
Edmund K. Burke ◽  
Qiang Guo ◽  
Graham Kendall

2000 ◽  
Vol 51 (11) ◽  
pp. 1289-1295 ◽  
Author(s):  
A Gómez ◽  
D de la Fuente

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

2000 ◽  
Vol 51 (11) ◽  
pp. 1289
Author(s):  
A. Gomez ◽  
D. de la Fuente

Sign in / Sign up

Export Citation Format

Share Document