Parallel greedy algorithms for packing unequal circles into a strip or a rectangle |
| |
Authors: | T Kubach A Bortfeldt H Gehring |
| |
Institution: | 1. Department of Information Systems, University of Hagen, Profilstrasse 8, 58084, Hagen, Germany
|
| |
Abstract: | Given a finite set of circles of different sizes we study the strip packing problem (SPP) as well as the Knapsack Problem
(KP). The SPP asks for a placement of all circles within a rectangular strip of fixed width so that the variable length of
the strip is minimized. The KP requires packing of a subset of the circles in a given rectangle so that the wasted area is
minimized. To solve these problems some greedy algorithms were developed which enhance the algorithms proposed by Huang et al.
(J Oper Res Soc 56:539–548, 2005). Furthermore, the new greedy algorithms were parallelized using a master slave approach.
The resulting parallel methods were tested using the instances introduced by Stoyan and Yaskov (Eur J Oper Res 156:590–600,
2004). Additionally, two sets of 128 instances each for the SPP and for the KP were generated and results for these new instances
are also reported. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|