作　　者： ;

机构地区： 广东警官学院

出　　处： 《微计算机信息》 2007年第03X期151-152,158,共3页

摘　　要： 计算机通信网络中的链路容量与流量分配(CFA)问题是一个极其复杂的网络优化问题。本文采用正交多主体遗传算法求解CFA问题,得到了满意的结果。大量的计算机仿真实验结果表明,与传统方法相比,本文的算法能迅速地求出全局近似最优解,解的质量也有大幅度的提高。 The problem of capacity and flow assignment （CFA） in computer communication networks is an extremely complex network optimization problem. It applies the orthogonal multi-agent genetic algorithm to solve the CFA problem in this paper, and some satisfied results are obtained. A great number of experimental results simulated by computer suggest that a near global solution of the CFA problem can be quickly obtained by the orthogonal multi-agent genetic algorithm compared with the traditional optimization method.

关 键 词： 计算机通信网 容量与流量分配 组合优化 遗传算法

领　　域： [自动化与计算机技术] [自动化与计算机技术]