首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于信息素的离散PSO算法
引用本文:许波桅,李军军.基于信息素的离散PSO算法[J].上海海事大学学报,2011,32(3):74-78.
作者姓名:许波桅  李军军
作者单位:1. 上海海事大学科技处,上海,201306
2. 上海海洋大学工程学院,上海,201306
基金项目:上海市优秀青年基金(ssc08022)
摘    要:为了将微粒群优化(Particle Swarm Optimization, PSO)算法应用到离散领域,并使算法仍具有较佳的搜索性能,以信息素积累为基础,由离散状态的信息素构成微粒编码,重新构造算法的迭代公式.微粒信息素的变化基于信息素原先的情况、个体历史最优及全局历史最优.以信息素为依据进行离散状态的选择,由此提出一种基于信息素的离散PSO算法.将该方法应用于基于时延约束的最小能耗路由优化问题,能获得较好的路由优化结果,表明该算法具有优良的收敛性能.

关 键 词:微粒群优化    信息素    无线传感网络    路由
收稿时间:2010/11/11 0:00:00
修稿时间:2011/6/13 0:00:00

Discrete particle swarm optimization algorithm based on pheromone
XU Bowei,LI Junjun.Discrete particle swarm optimization algorithm based on pheromone[J].Journal of Shanghai Maritime University,2011,32(3):74-78.
Authors:XU Bowei  LI Junjun
Institution:Shanghai Maritime University Basic Experiment and Training Center and 1
Abstract:To make particle swarm optimization algorithm with good search performance be applied to discrete domain, the particle coding is made up of the pheromones of discrete states based on the accumulation of pheromones. The iteration expressions are rebuilt. The changes of pheromones in particles are based on the original situation of pheromones, personal optimal pheromones and global optimal pheromones. The discrete states are chosen according to the pheromones. A discrete particle swarm optimization algorithm based on the pheromone is put forward. This method is applied to minimum energy routing optimization problem on the basis of delay constraints. The better routing optimization result shows that this algorithm possesses strong convergence capability.
Keywords:particle swarm optimization  pheromone  wireless sensor network  routing
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《上海海事大学学报》浏览原始摘要信息
点击此处可从《上海海事大学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号