Application Study On Performance Optimization Using Improved Simulated Annealing Algorithm In Computer Communication Networks

Route selection, capacity and flow assignment(CFA) are always the important and complex problems during the design and construction of computer communication networks. They are multi-restricted condition nonlinear optimization problem and belong to NP complete problem of combinatorial optimization. Simulated annealing algorithm is firstly used to solve both the two problems and is improved for three points. In route selection optimization, compared with the results of H Pirkul's method, tabu search algorithm, genetic algorithm, improved genetic algorithm, the results of this paper are much better, whether the average delay time or the used percent of links. So improved simulated annealing algorithm is more efficient than the other methods on the application of this problem. In the first branch of CFA problem, compared with the results of H Pirkul's method, tabu search algorithm, genetic algorithm, improved genetic algorithm, the results of this paper are worse than or comparative with improved genetic algorithm's, but are better than the other three methods'. In the other three branchs of CFA problem, the results of this paper are just compared with the results of H Pirkul's method and LinXiaohui's method(improved genetic algorithm), and much better than H Pirkul's. Compared with LinXiaohui's method, there are advantages and disadvantages in both methods. So improved simulated annealing algorithm can be used on the application of this problem.With the attempt of this paper, the application range of simulated annealing algorithm will be broadened, and a new feasible method is pointed out for many coming-up nonlinear optimization problem of the design and construction and optimization of computer communication networks.