论文部分内容阅读
求解 Steiner树对通信网络点对多点路由优化问题有重要意义 ,已被证明是 NP- complete的 .通过把图形简化技术、进化规划方法和 KMB启发式算法相结合 ,提出了一种求解 Steiner树问题的新方法 ,提高了算法的效率 .仿真结果表明 ,本算法是有效的 ,性能优于传统的启发式算法 .
Solving the Steiner tree is of great significance to the problem of point-to-multipoint routing in communication networks and has been proved to be NP-complete.Through the combination of graph simplification, evolutionary programming and KMB heuristics, The new method of the problem is raised and the efficiency of the algorithm is improved.The simulation results show that this algorithm is effective and its performance is better than the traditional heuristic algorithm.