摘要
文章综合考虑了具有跳数约束的R边连通网络优化设计问题。分析了用进化规划求解该问题的优点,提出了一种基于进化规划求解该问题的新方法。该方法首先采用启发式算法随机形成初始R边连通图,利用进化规划算法的全局搜索性能,通过一定的规则进行变异操作搜索问题的最优解。仿真结果验证了算法的有效性。
This paper consideres that the R-edge-connected network planning problem having hops-constraint based on evolutionary programming,and analyzes the advantages of using evolutionary programming to deal with the network planning problem.Then a novel method based on evolutionary programming is proposed to deal with the problem.Using this method,many initial R-edge-connectivity graph is random formed based on a heuristic algorithm,and then using the excellent globally tracking ability of the evolutionary programming,the optimal solution is tracked by mutation operation based on some regulation.Simulation results shows the effectiveness of the method.
出处
《计算机工程与应用》
CSCD
北大核心
2005年第2期161-164,共4页
Computer Engineering and Applications
基金
哈尔滨工业大学校基金资助(编号:HIT2001.30)
关键词
网络设计
跳数
R边连通
进化规划
network planning,hop,R-edge-connection,evolutionary programming
