The rectangular two-dimensional strip packing problem real-life practical constraints: A bibliometric overview

This paper deals with the three-dimensional container packing problem (3DCPP), which is to pack a number of items orthogonally onto a rectangular container so that the utilization rate of the container space or the total value of loaded items is maximized. Besides the above objectives, some other practical constraints, such as loading stability, the rotation of items around the height axis, and the fixed loading (unloading) orders, must be considered for the real-life 3DCPP. In this paper, a sub-volume based simulated annealing meta-heuristic algorithm is proposed, which aims at generating flexible and efficient packing patterns and providing a high degree of inherent stability at the same time. Computational experiments on benchmark problems show its efficiency.

Download Full-text

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

Fundamenta Informaticae ◽

10.3233/fi-2010-314 ◽

2010 ◽

Vol 102 (3-4) ◽

pp. 467-487 ◽

Cited By ~ 12

Author(s):

Takehide Soh ◽

Katsumi Inoue ◽

Naoyuki Tamura ◽

Mutsunori Banbara ◽

Hidetomo Nabeshima

Keyword(s):

Packing Problem ◽

Two Dimensional ◽

Strip Packing

Download Full-text

A Parallel Hyper-heuristic Approach for the Two-dimensional Rectangular Strip-packing Problem

Journal of Computing and Information Technology ◽

10.2498/cit.1002422 ◽

2015 ◽

Vol 22 (4) ◽

pp. 251 ◽

Cited By ~ 4

Author(s):

Istvan Borgulya

Keyword(s):

Packing Problem ◽

Heuristic Approach ◽

Two Dimensional ◽

Strip Packing ◽

Rectangular Strip

Download Full-text

A Reinforced Tabu Search Approach for 2D Strip Packing

Modeling, Analysis, and Applications in Metaheuristic Computing ◽

10.4018/978-1-4666-0270-0.ch011 ◽

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.

Download Full-text