کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
475924 699396 2009 16 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A beam search algorithm for the circular packing problem
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
A beam search algorithm for the circular packing problem
چکیده انگلیسی

In this paper, we propose to solve the circular packing problem (CPP) whose objective is to pack n   different circles CiCi of known radius ri,i∈N={1,…,n}, into the smallest containing circle C. The objective is to determine the radius r of C   as well as the coordinates (xi,yi)(xi,yi) of the center of the packed circles Ci,i∈N. CPP is solved by using an adaptive beam search algorithm that combines the beam search, the local position distance and the dichotomous search strategy. Decisions at each node of the developed tree are based on the well-known maximum hole degree that uses the local minimum distance. The computational results, on a set of instances taken from the literature, show the effectiveness of the proposed algorithm.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 36, Issue 5, May 2009, Pages 1513–1528
نویسندگان
, , ,