计算机通信网最优流量分配的新算法──混沌模拟退火优化方法

A new algorithm for computing the flow assignment of computer communication networks──chaos simulated annealing algorithm

本文将一种新的混合优化算法──混沌模拟退火优化方法应用于求解计算机通信网的最小网络迟延和流量分配问题。该方法充分利用了混饨优化方法和模拟退火优化方法的优点，具有遍历性、随机性以及全局、快速收敛的特点，避免了常规优化方法的局限性。实例计算结果表明，利用该方法进行计算机通信网的最小网络迟延和流量分配问题的优化计算，缩短了计算时间，增强了算法的鲁棒性，取得了满意的效果。

In this paper, a new combinatorial optimization approach, the chaos simulated annealing algorithm,is proposed and applied in solving the minimum average delay and flow assignment of a computer network. The approach makes full use of the advantages of both the chaos optimization approach and the simulated annealing algorithm. It is noted for its ergwhcity, stochastic property, and global and fast convergence. It avoids the limitations of the convenhonal optimization approaches. The simulation results on the vBNS demonstrate the new method is feasible and effective.