Solving circle packing problems by global optimization: numerical results and industrial applications (ABSTRACT)
Castillo, I., F.J. Kampas, and J.D. Pintér
published: 2008 | Research publication | Refereed Journals - ODS
Castillo, I., F.J. Kampas, and J.D. Pintér (2008). "Solving circle packing problems by global optimization: numerical results and industrial applications", European Journal of Operational Research, 191(3); 786. Special issue on continous optimization in the industry.
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.
Download the article at: http://proquest.umi.com/pqdweb?did=1496030671&sid=9&Fmt=2&clientId=27850&RQT=309&VName=PQD
revised Feb 21/07