.png){kind=icon}
返回
Evolutionary computation solutions to the circle packing problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-015-1603-y.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this work, we present an evolutionary omputation-based solution to the circle packing problem (ECPP). The circle packing problem consists of placing a set of circles into a larger containing circle without overlaps: a problem known to be NP-hard. Given the impossibility to solve this problem efficiently, traditional and heuristic methods have been proposed to solve it. A na < ve representation for chromosomes in a population-based heuristic search leads to high probabilities of violation of the problem constraints, i.e., overlapping. To convert solutions that violate constraints into ones that do not (i.e., feasible solutions), in this paper we propose two repair mechanisms. The first one considers every circle as an elastic ring and overlaps create repulsion forces that lead the circles to positions where the overlaps are resolved. The second one forms a Delaunay triangulation with the circle centers and repairs the circles in each triangle at a time, making sure repaired triangles are not modified later on. Based on the proposed repair heuristics, we present the results of the solution to the CPP problem to a set of unit circle problems (whose exact optimal solutions are known). These benchmark problems are solved using genetic algorithms, evolutionary strategies, particle swarm optimization, and differential evolution. The performance of the solutions is compared to those known solutions based on the packing density. We then perform a series of experiments to determine the performance of ECPP with non-unitary circles. First, we compare ECPP's results to those of a public competition, which stand as the world record for that particular instance of the non-unitary CPP. On a second set of experiments, we control the variance of the size of the circles. In all experiments, ECPP yields satisfactory near-optimal solutions.
Keyword:
Optimization
Circle packing
Evolutionary computation
Genetic algorithms
Evolutionary strategies
Particle swarm optimization
Differential evolution
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.5
论文数:
1.0W
被引数:
2.1W
机构
引用论文
.png){kind=icon}
Voltage Holding Prediction in Multi Electrode-multi Voltage Systems Insulated in Vacuum多电极-多电压真空绝缘系统中的电压保持预测
PREAI
分享收藏Laser-Induced Breakdown Spectroscopy (LIBS) Analysis of Calcium Ions Dissolved in Water Using Filter Paper Substrates: An Ideal Internal Standard for Precision Improvement使用滤纸基底对溶解在水中的钙离子进行激光诱导击穿光谱 (LIBS) 分析: 提高精度的理想内标
PREAI
分享收藏分享收藏
One-dimensional particle-in-cell simulation on the influence of electron and ion temperature on the sheath expansion process in the post-arc stage of vacuum circuit breaker一维粒子网格模拟研究了真空断路器电弧后阶段鞘层扩展过程中电子和离子温度的影响。
PREAI
分享收藏
查看更多内容