QoS Unicast Routing Algorithm Based on Particle Swarm Optimization and Mutable Simulated Annealing
Cheng Ai-hua, JI Zhong-heng, GE Bao-zhong · Jisuanji gongcheng · 2009
This paper presents a novel Mutable Simulated Annealing Particle Swarm Optimization(MSAPSO) algorithm for solving the QoS unicast routing problem. A new ⊕ operator is used in MSAPSO, which can simplify the iterative formulas of Particle Swarm Optimization(PSO) into a single one. In order to improve the diversity and the convergence of the algorithm, it designs a mutable Simulated Annealing(SA) operator, which joins the mutation operator of Genetic Algorithm(GA) and metropolis rules of SA into PSO. The results show that the MSAPSO is superior to PSO and Ant Colony Optimization(ACO) in convergence and searching success rate.