A Heuristic Based Algorithm for the 2D Circular Strip Packing Problem

2013 ◽  
pp. 73-92
Author(s):  
Hakim Akeb ◽  
Mhand Hifi ◽  
Dominique Lazure
Keyword(s):  
Packing Problem ◽  
Strip Packing

scholarly journals A SAT-based Method for Solving the Two-dimensional Strip Packing Problem

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

Robust mixed-integer linear programming models for the irregular strip packing problem

2016 ◽  
Vol 253 (3) ◽  
pp. 570-583 ◽  
Author(s):  
Luiz H. Cherri ◽  
Leandro R. Mundim ◽  
Marina Andretta ◽  
Franklina M.B. Toledo ◽  
José F. Oliveira ◽  
...  
Keyword(s):  
Linear Programming ◽  
Integer Linear Programming ◽  
Mixed Integer Linear Programming ◽  
Packing Problem ◽  
Programming Models ◽  
Mixed Integer ◽  
Strip Packing

A Reinforced Tabu Search Approach for 2D Strip Packing

2012 ◽  
pp. 171-188
Author(s):  
Giglia Gómez-Villouta ◽  
Jean-Philippe Hamiez ◽  
Jin-Kao Hao
Keyword(s):  
Tabu Search ◽  
Search Algorithm ◽  
Fitness Function ◽  
Packing Problem ◽  
Two Dimensional ◽  
Strip Packing ◽  
Benchmark Instances ◽  
Finite Set ◽  
Infinite Height ◽  
Search Approach

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.

Fast Heuristic Algorithms for the Multiple Strip Packing Problem

2021 ◽  
pp. 284-297
Author(s):  
Igor Vasilyev ◽  
Anton V. Ushakov ◽  
Maria V. Barkova ◽  
Dong Zhang ◽  
Jie Ren ◽  
...  
Keyword(s):  
Heuristic Algorithms ◽  
Packing Problem ◽  
Strip Packing

Fragmentary Structures in a Two-Dimensional Strip Packing Problem

2019 ◽  
Vol 55 (6) ◽  
pp. 943-948
Author(s):  
I. V. Kozin ◽  
S. E. Batovskyi
Keyword(s):  
Packing Problem ◽  
Two Dimensional ◽  
Strip Packing

Improved metaheuristics for the two-dimensional strip packing problem

2020 ◽  
Vol 92 ◽  
pp. 106268 ◽  
Author(s):  
Rosephine G. Rakotonirainy ◽  
Jan H. van Vuuren
Keyword(s):  
Packing Problem ◽  
Two Dimensional ◽  
Strip Packing

An Exact Approach to the Strip-Packing Problem

2003 ◽  
Vol 15 (3) ◽  
pp. 310-319 ◽  
Author(s):  
Silvano Martello ◽  
Michele Monaci ◽  
Daniele Vigo
Keyword(s):  
Packing Problem ◽  
Strip Packing ◽  
Exact Approach

scholarly journals Un algoritmo para el Strip Packing Problem obtenido mediante la extracción de habilidades de expertos usando minería de datos

2016 ◽  
Vol 17 (2) ◽  
pp. 179-190
Author(s):  
Gatica Gustavo ◽  
Reyes Pablo ◽  
Contreras-Bolton Carlos ◽  
Linfati Rodrigo ◽  
Escobar John Willmer
Keyword(s):  
Packing Problem ◽  
Strip Packing
Sign in / Sign up

Export Citation Format

Share Document