Solving circle packing problems by global optimization: Numerical results and industrial applications |
| |
Authors: | Ignacio Castillo Frank J Kampas János D Pintér |
| |
Institution: | 1. School of Business and Economics, Wilfrid Laurier University, Waterloo, Ontario, Canada;2. WAM Systems Inc., Plymouth Meeting, PA, USA;3. Pintér Consulting Services Inc., Halifax, Nova Scotia, Canada |
| |
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. |
| |
Keywords: | Circle packing problems Global optimization Industrial applications Numerical examples |
本文献已被 ScienceDirect 等数据库收录! |
|