摘要
求解计算机通信网的时延和路由选择是一个多约束条件的非线性优化问题，采用遗传算法求解是目前比较有效的方法。本文以遗传算法的基本思想为基础，提出了一种新的遍历匹配选择法，通过实例计算，采用这一选择方式的遗传算法能快速求出问题的全局近似最优解，且具有较高的计算精度。
The Solutions of the delay and the optimal routing for computer communication network is a nonlinear optimal problem with multi-constrained conditions.The genetic algorithm(GA(is a more effective method. On the basis of genetic algorithm,the ergotic matching-choose method is prooposed. The computations of several examples show that it not only can find rapidly the approsimate global optimal solution,but also has high computing accuracy.
出处
《南京邮电学院学报》
北大核心
1996年第2期16-21,共6页
Journal of Nanjing University of Posts and Telecommunications(Natural Science)
基金
邮电部科技司资助
关键词
计算机通信网
路由
遣传算法
遍历匹配选择法
Neural networks
Computer communication network
Routing selection
Genetic algorithm
