An improved algorithm for the packing of unequal circles within a larger containing circle
نویسندگان
چکیده
This paper describes an approved algorithm for the problems of unequal circle packing – the quasi-physical quasihuman algorithm. First, the quasi-physical approach for the general packing problems is described in solving the pure problems of unequal circle packing. The method is an analogy to the physical model in which a number of smooth cylinders are packed inside a container. A quasi-human strategy is then proposed to trigger a jump for a stuck object in order to get out of local minima. Our method has been tested in numerical experiments. The computational results are presented, showing the merits of the proposed method. Our algorithm can be thought as an adoptive algorithm of the Tabu search. 2002 Published by Elsevier Science B.V.
منابع مشابه
Iterated Tabu Search Algorithm for Packing Unequal Circles in a Circle
This paper presents an Iterated Tabu Search algorithm (denoted by ITSPUCC) for solving the problem of Packing Unequal Circles in a Circle. The algorithm exploits the continuous and combinatorial nature of the unequal circles packing problem. It uses a continuous local optimization method to generate locally optimal packings. Meanwhile, it builds a neighborhood structure on the set of local mini...
متن کاملAn effective hybrid algorithm for the problem of packing circles into a larger containing circle
Simulated annealing is a powerful stochastic search method, but it still has the disadvantage of blind search. Tabu search (TS) which can prevent cycling and enhance diversi/cation, is an adaptive strategy based on tabu list. By reasonably combining simulated annealing with TS, an e#ective hybrid algorithm for the problem of packing circles into a larger containing circle is presented. Based on...
متن کاملPacking Circles within Circular Containers: a New Heuristic Algorithm for the Balance Constraints Case
In this work we propose a heuristic algorithm for the layout optimization for disks installed in a rotating circular container. This is a unequal circle packing problem with additional balance constraints. It proved to be an NP-hard problem, which justifies heuristics methods for its resolution in larger instances. The main feature of our heuristic is based on the selection of the next circle t...
متن کاملGreedy algorithms for packing unequal circles into a rectangular container
In this paper, we study the problem of packing unequal circles into a 2D rectangular container. We solve this problem by proposing two greedy algorithms. The first algorithm, denoted by B1.0, selects the next circle to place according to the maximum hole degree rule, which is inspired from human activity in packing. The second algorithm, denoted by B1.5, improves B1.0 with a self look-ahead sea...
متن کاملA Two-Level Search Strategy for Packing Unequal Circles into a Circle Container
We propose a two-level search strategy to solve a two dimensional circle packing problem. At the first level, a good enough packing algorithm called A1.0 uses a simple heuristic to select the next circle to be packed. This algorithm is itself used at the second level to select the next circle to be packed. The resulted packing procedure called A1.5 considerably improves the performance of the a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- European Journal of Operational Research
دوره 141 شماره
صفحات -
تاریخ انتشار 2002