.png){kind=icon}
返回
Quasi-physical global optimization method for solving the equal circle packing problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s11432-011-4270-3.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The equal circle packing problem is a well-known challenge in geometry. It is also a natural, clear and fair test system for global optimization. This paper presents a quasi-physical global optimization algorithm for solving the equal circle packing problem. The algorithm simulates two kinds of movements of N elastic disks: smooth movement driven by elastic pressures and violent movement driven by strong repulsive forces and attractive forces. The smooth movement makes the disks reach a locally optimal configuration, while the violent movement makes them jump out of the local optimum trap and reach a more promising place. The algorithm is tested on the widely studied instances of N = 1, 2, ..., 150. We find better packings than the reported best-known ones on 37 instances and reproduce the best-known results on the remaining 113 instances.
Keyword:
equal circle packing
global optimization
quasi-physical method
heuristic
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
4.9K
被引数:
8.9K
机构
暂无机构信息
.png){kind=icon}
没有更多内容