精英正交学习萤火虫算法

计算机科学 ›› 2015, Vol. 42 ›› Issue (10): 211-216.

精英正交学习萤火虫算法

周凌云,丁立新,何进荣

武汉大学软件工程国家重点实验室武汉430072;中南民族大学计算机科学学院武汉430074,武汉大学软件工程国家重点实验室武汉430072,武汉大学软件工程国家重点实验室武汉430072

出版日期:2018-11-14 发布日期:2018-11-14
基金资助:
本文受国家自然科学基金(61379059,61103248),中央高校基本科研业务费专项资金(CZY14011)资助

Elite Orthogonal Learning Firefly Algorithm

ZHOU Ling-yun, DING Li-xin and HE Jin-rong

Online:2018-11-14 Published:2018-11-14

摘要/Abstract

摘要： 针对萤火虫算法后期收敛较慢以及求解精度不高的问题,提出了精英正交学习萤火虫算法。该算法利用精英萤火虫采用正交学习策略来构造指导向量,以保存和发现最优方向信息,从而引导群体更准确地飞向全局最优区域。同时,还采用了自适应步长技术来更好地平衡算法探索与开发能力,采用最小吸引力参数保证高维空间距离过大的个体之间的相互吸引。在6个经典测试函数上与标准萤火虫算法及其它3种改进的萤火虫算法进行了对比,实验结果表明,提出的算法具有较快的收敛速度和较高的收敛精度。

关键词: 萤火虫优化,精英,正交学习,指导向量

Abstract: In order to overcome the shortcomings of firefly algorithm such as slow convergence speed and low computational accuracy,an elite orthogonal learning firefly algorithm was proposed.An elite firefly was introduced to construct a guidance vector using the orthogonal learning strategy,which can preserve and discover useful information in the population best positions and direct the swarm to fly toward the global optimal region.At the same time,the method of adaptive step size was used to balance the exploration and exploitation ability of the algorithm,and the minimum attractive parameter was adopted to guarantee the attraction among the fireflies whose distance is large.We compared the proposed algorithm with standard firefly algorithm and other three improved firefly algorithms on six benchmarks,and the results show that the proposed algorithm obtains quicker convergence speed and better solution accuracy.

Key words: Firefly optimization,Elite,Orthogonal learning,Guidance vector

周凌云,丁立新,何进荣. 精英正交学习萤火虫算法[J]. 计算机科学, 2015, 42(10): 211-216. https://doi.org/

ZHOU Ling-yun, DING Li-xin and HE Jin-rong. Elite Orthogonal Learning Firefly Algorithm[J]. Computer Science, 2015, 42(10): 211-216. https://doi.org/

参考文献

[1] Yang X S.Nature-inspired metaheuristic algorithms[M].Luni-ver press,2010
[2] Yang X S.Firefly algorithms for multimodal optimization[M]∥Stochastic algorithms:foundations and applications.Springer Berlin Heidelberg,2009:169-178
[3] Marichelvam M K,Prabaharan T,Yang X S.A discrete firefly algorithm for the multi-objective hybrid flowshop scheduling problems[J].IEEE Transactions on Evolutionary Computation,2014,8(2):301-305
[4] Yang X S,Hosseini S S S,Gandomi A H.Firefly algorithm for solving non-convex economic dispatch problems with valve loading effect[J].Applied Soft Computing,2012,12(3):1180-1186
[5] Falcon R,Almeida M,Nayak A.Fault identification with binary adaptive fireflies in parallel and distributed systems[C]∥2011 IEEE Congress on Evolutionary Computation (CEC).IEEE,2011:1359-1366
[6] Senthilnath J,Omkar S N,Mani V.Clustering using firefly algorithm:Performance study[J].Swarm and Evolutionary Computation,2011,1(3):164-171
[7] Fister I,JrFister I,Yang X S,et al.A comprehensive review of firefly algorithms[J].Swarm and Evolutionary Computation,2013,13(1):34-46
[8] Eslami M,Shareef H,Khajehzadeh M.Firefly algorithm andpattern search hybridized for global optimization [M]∥Intelligent Computing Theories and Technology.Springer Berlin Heidelberg,2013:172-178
[9] Husselmann A V,Hawick K A.Parallel parametric optimisation with firefly algorithms on graphical processing units[C]∥Proceedings of the 2012 World Congress in Computer Science,Computer Engineering,and Applied Computing.2012
[10] Yang X S.Firefly algorithm,Levy flights and global optimization[M]∥Research and Development in Intelligent Systems XXVI.Springer London,2010:209-218
[11] Tilahun S L,Ong H C.Modified firefly algorithm[J].Journal of Applied Mathematics,2012,2012:1-12
[12] Farahani S M,Abshouri A A,Nasiri B,et al.A Gaussian firefly algorithm[J].International Journal of Machine Learning and Computing,2011,1(5):448-453
[13] Zhang Q,Leung Y W.An orthogonal genetic algorithm for multimedia multicast routing[J].IEEE Transactions on Evolutionary Computation,1999,3(1):53-62
[14] Hu X M,Zhang J,Li Y.Orthogonal methods based ant colony search for solving continuous optimization problems[J].Journal of Computer Science and Technology,2008,23(1):2-18
[15] Ho S Y,Ho S J,Lin Y K,et al.An orthogonal simulated annealing algorithm for large floorplanning problems[J].IEEE Transactions on Very Large Scale Integration (VLSI) Systems,2004,12(8):874-877
[16] Zhan Z H,Zhang J,Li Y,et al.Orthogonal learning particleswarm optimization[J].IEEE Transactions on Evolutionary Computation,2011,15(6):832-847
[17] Ho S Y,Shu L S,Chen J H.Intelligent evolutionary algorithms for large parameter optimization problems[J].IEEE Transactions on Evolutionary Computation,2004,8(6):522-541
[18] 纪震,周家锐,廖惠连,等.智能单粒子优化算法[J].计算机学报,2010,33(3):556-561 Ji Zhen,Zhou Jia-rui,Liao Hui-lian,et al.A Novel Intelligent Single Particle Optimizer[J].Chinese Journal of Computers,2010,33(3):556-561
[19] Liang J J,Suganthan P N,Deb K.Novel composition test functions for numerical global optimization[C]∥Proceedings 2005 IEEE Swarm Intelligence Symposium,2005(SIS 2005).IEEE,2005:68-75

Metrics

Viewed

Full text

Abstract

Cited

Shared

Discussed