CALCULATE THE MINIMUM SPANNING TREE OF COMMUNICATION NETWORK USING SIMULATED ANNEALING ALGORITHM
Xiao Zhang · Journal of Chengdu University of Technology · 2002
The basic thought of Simulated Annealing algorithm is introduced in this paper. This algorithm is successfully used to solve the problem of optimal calculation of the minimum spanning tree of communication network. The computed result indicates that the algorithm can jump out of the local optimization efficiently and constringe the global optimization quickly. So, the Simulated Anneaning algorithm is a general, powerful combinatorial optimization algorithm with the ability to ascend according to the probability.