.png){kind=icon}
返回
PERM for solving circle packing problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2006.10.012.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we develop a new algorithm that incorporates the improved PERM into an already existing simple deterministic heuristic, the principle of maximum cave degree for corner-occupying actions, to solve the problem of packing equal or unequal circles into a larger circle container. We compare the performance of our algorithm on several problem instances taken from the literature with previous algorithms. The computational results show that the proposed approach produces high-quality solutions within reasonable computational times. Although our algorithm is less efficient than Zhang's for several large-scale equal-size instances, it is noteworthy that for several unequal circle instances we found new lower bounds missed in previous papers. (c) 2006 Elsevier Ltd. All rights reserved.
Keyword:
circle packing
PERM
corner-occupying action
cave degree
NP-hard
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏Correspondence between entropy-corrected holographic and Gauss-Bonnet dark-energy models熵校正全息和gauss-bonnet暗能量模型之间的对应关系
OAAI
OAAI分享收藏Ultrasonographic Findings in Eyes With Retinal Detachments Secondary to Retinopathy of Prematurity
PREAI
分享收藏
查看更多内容