Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem

2012 ◽  
Vol 39 (3) ◽  
pp. 678-686 ◽  
Author(s):  
Stephen C.H. Leung ◽  
Yangbin Lin ◽  
Defu Zhang
Keyword(s):  
Nonlinear Programming ◽  
Local Search ◽  
Search Algorithm ◽  
Packing Problem ◽  
Two Dimensional ◽  
Local Search Algorithm ◽  
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.

scholarly journals A Hybrid Demon Algorithm for the Two-Dimensional Orthogonal Strip Packing Problem

2015 ◽  
Vol 2015 ◽  
pp. 1-14 ◽  
Author(s):  
Bili Chen ◽  
Yong Wang ◽  
Shuangyuan Yang
Keyword(s):  
Local Search ◽  
Hybrid Algorithm ◽  
Packing Problem ◽  
Two Dimensional ◽  
Strip Packing ◽  
Benchmark Instances ◽  
Placement Procedure

This paper develops a hybrid demon algorithm for a two-dimensional orthogonal strip packing problem. This algorithm combines a placement procedure based on an improved heuristic, local search, and demon algorithm involved in setting one parameter. The hybrid algorithm is tested on a wide set of benchmark instances taken from the literature and compared with other well-known algorithms. The computation results validate the quality of the solutions and the effectiveness of the proposed algorithm.

scholarly journals A Reinforced Tabu Search Approach for 2D Strip Packing

2010 ◽  
Vol 1 (3) ◽  
pp. 20-36 ◽  
Author(s):  
Giglia Gómez-Villouta ◽  
Jean-Philippe Hamiez ◽  
Jin-Kao Hao
Keyword(s):  
Tabu Search ◽  
Search Algorithm ◽  
Fitness Function ◽  
Packing Problem ◽  
Local Search Algorithm ◽  
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.

Sign in / Sign up

Export Citation Format

Share Document