| 计算机网络中容量与流量分配优化研究 |
| |
| 引用本文： | 林永和.计算机网络中容量与流量分配优化研究[J].微计算机信息,2007,23(9). |
| |
| 作者姓名： | 林永和 |
| |
| 作者单位： | 510232,广州,广东警官学院 |
| |
| 摘 要： | 计算机通信网络中的链路容量与流量分配(CFA)问题是一个极其复杂的网络优化问题。本文采用正交多主体遗传算法求解CFA问题,得到了满意的结果。大量的计算机仿真实验结果表明,与传统方法相比,本文的算法能迅速地求出全局近似最优解,解的质量也有大幅度的提高。
|
| 关 键 词： | 计算机通信网 容量与流量分配 组合优化 遗传算法 |
The Optimization of Capacity and Flow Assignment in Computer Communication Networks |
| |
| LIN YONGHE.The Optimization of Capacity and Flow Assignment in Computer Communication Networks[J].Control & Automation,2007,23(9). |
| |
| Authors: | LIN YONGHE |
| |
| Abstract: | 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. |
| |
| Keywords: | computer communication networks capacity and flow assignment combinatorial optimization genetic algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
