基于禁忌搜索算法的计算机通信网络中容量与流量分配问题的优化研究

为了降低网络的运营费用与改进网络性能，首次采用近年来新出现的一种高效的现代超启发式搜索方法——禁忌搜索算法求解计算机通信网络中链路容量与流量分配(CFA)问题，讨论了计算机通信网络中链路的固定费用、时延费用与可变费用对运营总费用的影响．大量的计算机仿真实验结果不仅验证了禁忌搜索算法对求解CFA问题的有效性，而且与传统的拉格朗日松弛及子梯度寻优算法相比，解的质量有大幅度提高；与遗传算法相比，对大规模或负荷很重的网络，该算法更具优越性．

Study on optimization of capacity and flow assignments in computer communication networks based on tabu search algorithm

In order to decrease operational costs and improve the performance of networks,a new and efficient modern meta-heuristic search method based on tabu search algorithm for solving the problem of link capacity and flow assignment (CFA) in computer communication networks is presented in this paper for the first time.The influence of link fixed cost,delay and variable expenditures on the total operational costs in computer communication networks are discussed.The results of a great number of computer simulation experiments show that,not only the effectiveness of tabu search algorithm for solving CFA problem has been borne out,but also,compared with the traditional Lagrangean relaxation and subgradient optimization method,the obtained solution has higher accuracy; and compared with the genetic algorithm,the superiority of tabu search algorithm is further shown in large-size or heavily loaded networks.