摘要
在可靠性条件约束下,使网络成本最低是网络规划NP-hard问题。从遗传算法的基本原理出发并对其进行改进,分析带有可靠性约束条件的通信网设计中的网络优化问题,这一方法的最大优点是可将其推广到求解一般带有约束的网络优化问题。而且结果表明无论是解的精度还是运算速度遗传算法都优于分枝定界法及其它启发式算法。
It is NP - hard problem to find a network topology for a set of nodes whose total link - cost is minimized, subjected to the condition of reliability. Basing on the theorem of genetic algorithm, this paper analyses the problem of design of network optimization with a constraint. This technique is very powerful because the same approach can be extended to solve different types of optimization problems with constraint. Results show that GA can produce better solutions than branch and bound in accuracy and computation time.
出处
《计算机技术与发展》
2007年第1期63-64,68,共3页
Computer Technology and Development
关键词
通信网络
遗传算法
网络优化
可靠性约束
communication networks
genetic algorithm
network optimization
reliability constraint
