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

• 数学与计算机科学 • 上一篇    下一篇

基于方差的优良粒子群多约束路由选择算法

  

  1. 福建师范大学闽南科技学院计算机系,福建泉州362332
  • 收稿日期:2015-06-19 出版日期:2015-12-15 发布日期:2015-12-15
  • 作者简介:马刚,助教,主要从事计算机算法与网络研究.

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

中图分类号: