Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
481264 | European Journal of Operational Research | 2008 | 17 Pages |
Abstract
A (general) circle packing is an optimized arrangement of N arbitrary sized circles inside a container (e.g., a rectangle or a circle) such that no two circles overlap. In this paper, we present several circle packing problems, review their industrial applications, and some exact and heuristic strategies for their solution. We also present illustrative numerical results using ‘generic’ global optimization software packages. Our work highlights the relevance of global optimization in solving circle packing problems, and points towards the necessary advancements in both theory and numerical practice.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Ignacio Castillo, Frank J. Kampas, János D. Pintér,