Solving circle packing problems by global optimization:: Numerical results and industrial applications

被引：146

作者：

Castillo, Ignacio ^{[1
]}

Kampas, Frank J. ^{[2
]}

Pinter, Janos D. ^{[3
]}

机构：

[1] Wilfrid Laurier Univ, Sch Business & Econ, Waterloo, ON N2L 3C5, Canada

[2] WAM Syst Inc, Plymouth Meeting, PA USA

[3] Pinter Consulting Serv Inc, Halifax, NS, Canada

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2008年 / 191卷 / 03期

基金：

加拿大自然科学与工程研究理事会;

关键词：

circle packing problems; global optimization; industrial applications; numerical examples;

D O I：

10.1016/j.ejor.2007.01.054

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

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.

引用

页码：786 / 802

页数：17

共 46 条

[1]

Adickes MD, 2002, IIE TRANS, V34, P823

[2] An Attractor-Repeller approach to floorplanning [J].