Пакування масштабованих кругів

Abstract

Optimized packing a family of non-identical scaling circles in a given circular container is studied. The problem is aimed at finding a maximal scaling parameter of the circles subject to pairwise non-overlapping of scaling circles and containment each scaling circle to a fixed circular container taking into account allowable distances. The corresponding continuous nonlinear programming model is presented. A multistart solution strategy is provided and illustrated with computational results. This problem can be applied for finding feasible starting points to search for local optimal solutions of dense and sparse circular packing problems.