J4 ›› 2015, Vol. 14 ›› Issue (12): 22-25.

Previous Articles     Next Articles

Multi-constrained Routing Algorithm Based on Variance of Fine Particle Swarm Optimization

  

  1. (Department of Computer Science, Minnan Science and Technology Institute, Fujian Normal University, Quanzhou,
    Fujian 362332, China)
  • Received:2015-06-19 Online:2015-12-15 Published:2015-12-15

Abstract:

The mathematical variance measures the relationship of different distances between a data and the data collection central
value. Inspired by this relationship, the traditional particle swarm optimization algorithm will be improved, the excellent particle group
will be picked out as the next generation of particles, and routing algorithm based on an excellent particle swarm optimization algorithm
will be designed. This algorithm inherits the traditional algorithm, and improves the convergence rate and reduces the computational
quantity.

Key words: mathematical variance, particle swarm optimization algorithm, routing

CLC Number: