欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
Steiner最优树问题是指对于给定区域内的点集，通过引入Steiner点集将区域中的点连接并保证连通的网络达到最小．该问题已成为经典的优化组合问题之一．提出一种基于模拟植物生长算法生成Steiner最优树的连通算法来实现网络连通．通过对实例的实验及结果分析，结果表明本算法不仅可获得最优解，精度和性能也有提高，明显优于其它方法．
英文摘要：
Steiner Minimum Tree Problem is to find out the shortest network satisfying specified connectivity requirements, which connects a set of points in a given area. This problem has become one of classical optimal problems. This paper proposes a new method--plant growth simulation algorithm under the consideration of both reducing power consumption and cost. then, through the analysis of the algorithm and the experimental tests on real instances, the results show that the algorithm proposed by this paper is superior to the other algorithms on both precision and performance.
同期刊论文项目
同项目期刊论文
位置：