Journal
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS
Volume 89, Issue 10, Pages 1355-1369Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1080/00207160.2012.685468
Keywords
packing; circle; prohibited area; modelling; optimization
Categories
Ask authors/readers for more resources
The paper considers the problem of packing a maximal number of identical circles of a given radius into a multiconnected domain. The domain is a circle with prohibited areas to be finite unions of circles of given radii. We construct a mathematical model of the problem and investigate its characteristics. The starting points are constructed in a random way or on the ground of the hexagonal lattice. To find the local maxima, a modification of the Zoutendijk method of feasible directions and a strategy of active inequalities are applied. We compare our results with the benchmark instances of packing circles into circular and annular containers. A number of numerical examples are given.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available