Fragmentary Structures in a Two-Dimensional Strip Packing Problem

2019 ◽  
Vol 55 (6) ◽  
pp. 943-948
Author(s):  
I. V. Kozin ◽  
S. E. Batovskyi

2010 ◽  
Vol 102 (3-4) ◽  
pp. 467-487 ◽  
Author(s):  
Takehide Soh ◽  
Katsumi Inoue ◽  
Naoyuki Tamura ◽  
Mutsunori Banbara ◽  
Hidetomo Nabeshima


Author(s):  
Giglia Gómez-Villouta ◽  
Jean-Philippe Hamiez ◽  
Jin-Kao Hao

This paper discusses a particular “packing” problem, namely the two dimensional strip packing problem, where a finite set of objects have to be located in a strip of fixed width and infinite height. The variant studied considers regular items, rectangular to be precise, that must be packed without overlap, not allowing rotations. The objective is to minimize the height of the resulting packing. In this regard, the authors present a local search algorithm based on the well-known tabu search metaheuristic. Two important components of the presented tabu search strategy are reinforced in attempting to include problem knowledge. The fitness function incorporates a measure related to the empty spaces, while the diversification relies on a set of historically “frozen” objects. The resulting reinforced tabu search approach is evaluated on a set of well-known hard benchmark instances and compared with state-of-the-art algorithms.



2020 ◽  
Vol 92 ◽  
pp. 106268 ◽  
Author(s):  
Rosephine G. Rakotonirainy ◽  
Jan H. van Vuuren


2009 ◽  
Vol 198 (1) ◽  
pp. 73-83 ◽  
Author(s):  
Mitsutoshi Kenmochi ◽  
Takashi Imamichi ◽  
Koji Nonobe ◽  
Mutsunori Yagiura ◽  
Hiroshi Nagamochi


2009 ◽  
Vol 48 (7) ◽  
pp. 2011-2028 ◽  
Author(s):  
Jesica de Armas ◽  
Coromoto León ◽  
Gara Miranda ◽  
Carlos Segura


2013 ◽  
Vol 40 (14) ◽  
pp. 5542-5550 ◽  
Author(s):  
Kun He ◽  
Yan Jin ◽  
Wenqi Huang


Sign in / Sign up

Export Citation Format

Share Document