期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 191, 期 3, 页码 786-802出版社
ELSEVIER
DOI: 10.1016/j.ejor.2007.01.054
关键词
circle packing problems; global optimization; industrial applications; numerical examples
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. (C) 2007 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据