1. 安徽大学 计算智能与信号处理重点实验室,安徽,合肥,230039
2. 安徽大学 计算机与科学与技术学院,安徽,合肥,230601
纸质出版:2018
移动端阅览
左仲亮, 郭星, 李炜. 一种改进的萤火虫算法[J]. 微电子学与计算机, 2018, 35(2): 61-66.
ZUO Zhong-liang, GUO Xing, LI Wei. An Improved Swarm Optimization Alogorithm[J]. 2018, 35(2): 61-66.
为了克服原始萤火虫算法(Glowworm swarm optimization
GSO)对于高维、多峰函数寻优精度不高和后期收敛速度较慢的问题.为此
有针对性地提出了一种改进的动态步长萤火虫优化算法
在整个迭代期间
萤火虫的算法步长呈非线性递减.在寻优初期保持着一个相对较大的步长进行搜索
增强其全局寻优能力
在算法后期保持一个较小的移动步长
增强其局部搜索能力.此外将原始萤火虫算法在Nit集合为0时不移动
改成试探性向外随机移动策略.采用该算法的改进思想
能在一定的程度上避免算法因为过早的成熟而陷入局部最优
并且改进的算法比原始萤火虫算法有着更好的收敛精度.通过与原始GSO和改进算法ASGSO做对比
Matlab实验仿真表明
此改进算法在一定程度上提高了收敛速度和寻优精度.
In order to overcome the basic artifical firefly algorithm(GSO) in solving problems of low precision for the multi peak function
high dimension and slow convergence. Thus
this paper comes up with a Dynamic step optimization algorithm. During the iteration
the step decrease nonlinearly. At the beginning of the optimization maintains a large step to search optimal value
enhancing global optimization ability. At the ending of it
optimization maintains a small step to improve ablity of local searching. In addition
original firely algorithm does not move anywhere
when Nit is null. this paper makes it move somewhere randomly. With it
This algorithm can avoid being mature and falling into a local value. As the same time
improved GSO can achieve a higher accuracy during Iterative process.
comparing with GSO and reference literature alogorithm ASGSO. According to the simulation experiment
it shows that to some extent
the improved algorithm on covergence speend and precision are enhanced.
Krishand K N, Ghose D. Glowworm swarm optimisation for simulataneous capture of mutiple local optima of multimodal funcations[J]. Swarm Intelligence, 2009, 3(2): 87-124. DOI: 87
Deep K, Bansal J C Mean particle swarm optimization for function optimization[J]. International Studies, 2009, 1(1): 72-79. DOI: 72
Simakov D, Caspi Y, Shechtman E, et al. Summarizing visual data using bidrectionnal similarity[C] //Proc of CVPR 08. Anchorage, Alaska, USA, 2008.
郁书好, 苏守宝. 一种改进的变步长萤火虫优化算法[J]. 小型微型计算机系统, 2014, 35(6): 1396-1400. DOI: 1396
欧阳喆, 周永权. 自适应步长萤火虫优化算法[J]. 计算机应用, 2011, 31(7): 1804-1807. DOI: 1804
贺春华, 张湘伟. 竞选算法的参数设计与性能研究[J]. 计算机工程, 2010, 36(6): 201-203. DOI: 201
段艳明, 肖辉辉. 一种新的自适应步长果蝇优化算法[J]. 河南师范大学学报(自然科学版), 2016, 56(1): 161-168. DOI: 161
0
浏览量
9
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010602201714号