Author Login Chief Editor Login Reviewer Login Editor Login Remote Office

›› 1999, Vol. 25 ›› Issue (08): 24-25.

• Papers • Previous Articles     Next Articles

Solve Steiner Tree Problem Based on Evolutionary Programming

Qu Runtao, Xi Yugeng, Han Bing   

  1. (Dept. of Automation. Shanghai Jiaotong University, Shanghai 200030)
  • Published:1999-08-25

基于进化规划求解Steiner Tree问题

曲润涛,席裕庚,韩兵   

  1. 上海交通大学自动化研究所 上海 200030,上海交通大学自动化研究所 上海 200030,上海交通大学自动化研究所 上海 200030

Abstract: In this paper a novel method based on evoluhonary programming is proposed to solve the Steiner Tree Problem, we combinedwith the heuristic algorithm to improve the efficient of the evolutionary algorithm. The effective of evolutionary programming algorithm isgiven out through shoulation.

摘要: 提出基于进化规划求解SteinerTree问题的新方法,通过和原有启发式算法的结合提高了进化算法的效率,仿真证明了进化规划算法的有效性。

关键词: SteinerTree, 进化规划, NP-complete

CLC Number: