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

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.

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.


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

2020 ◽  
Vol 2020 ◽  
pp. 1-11
Author(s):  
Ruizhi Li ◽  
Yupan Wang ◽  
Shuli Hu ◽  
Jianhua Jiang ◽  
Dantong Ouyang ◽  
...  

The set packing problem (SPP) is a significant NP-hard combinatorial optimization problem with extensive applications. In this paper, we encode the set packing problem as the maximum weighted independent set (MWIS) problem and solve the encoded problem with an efficient algorithm designed to the MWIS problem. We compare the independent set-based method with the state-of-the-art algorithms for the set packing problem on the 64 standard benchmark instances. The experimental results show that the independent set-based method is superior to the existing algorithms in terms of the quality of the solutions and running time obtained the solutions.


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

Sign in / Sign up

Export Citation Format

Share Document