[1]ZHAO Jia,LYU Li,FAN Tanghuai.Shuffled frog-leaping algorithm based on the general center[J].CAAI Transactions on Intelligent Systems,2015,10(3):414-421.[doi:10.3969/j.issn.1673-4785.201405070]
Copy

Shuffled frog-leaping algorithm based on the general center

CAAI Transactions on Intelligent Systems[ISSN 1673-4785/CN 23-1538/TP] Volume: 10 Number of periods: 2015 3 Page number: 414-421 Column: 学术论文—人工智能基础 Public date: 2015-06-25
Title:
Shuffled frog-leaping algorithm based on the general center
Author(s):
ZHAO Jia;  LYU Li;  FAN Tanghuai
School of Information Engineering, Nanchang Institute of Technology, Nanchang 330099, China
Keywords:
frog-leaping algorithm; shuffled frog leaping algorithm (SFLA); general center; frog leaping rule; swarm intelligence algorithms
CLC:
TP301
DOI:
10.3969/j.issn.1673-4785.201405070
Abstract:
In this paper, a shuffled frog-leaping algorithm based on general center (GC-SFLA) is proposed to solve the problem of weak information sharing between memeplexes in the shuffled frog leaping algorithm (SFLA) to enhance the learning ability and use the average center of optimal frog. The proposed GC-SFLA generates a virtual general center frog from the optimal frog of each memeplex. Firstly, the optimal frog selects the best location among the original location and general center greedily as new location of new memeplex. After that, the advantage of general center frog is applied to the frog-leaping rule, which enable the worst frog to learn from the general center frog. Experiments are conducted on a set of swarm intelligence algorithms to verify that the new approach outperforms SFLA in different dimensions. The experiment results present promising performance of the GC-SFLA on convergence velocity, precision and stability of solution.
References:
[1] EUSUFF M M, LANSEY K E. Optimization of water distribution network design using the shuffled frog leaping algorithm[J]. Journal of Water Resources Planning and Management, 2003, 129(3): 210-225.
[2] MOSCATO P. On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms, Technical report C3P 826[R]. Pasadena, USA: California Institute of Technology, 1989.
[3] KENNEDY J, EBERHART R. Particle swarm optimization[C]//Proceedings of the IEEE International Conference on Neural Networks. Perth, Australia, 1995: 1942-1948.
[4] RAHIMI-VAHED A, MIRZAEI A H. A hybrid multi-objective shuffled frog-leaping algorithm for a mixed-model assembly line sequencing problem[J]. Computers & Industrial Engineering, 2007, 53(4): 642-666.
[5] 崔文华, 刘晓冰, 王伟, 等. 混合蛙跳算法研究综述[J]. 控制与决策, 2012, 27(4): 481-486, 493.CUI Wenhua, LIU Xiaobing, WANG Wei, et al. Survey on shuffled frog leaping algorithm[J]. Control and Decision, 2012, 27(4): 481-486, 193.
[6] FAN Tanghuai, LU Li, ZHAO Jia. Improved shuffled frog leaping algorithm and its application in node localization of wireless sensor networks[J]. Intelligent Automation & Soft Computing, 2012, 18(7): 807-818.
[7] XIA Li, LUO Jianping, CHEN Minrong, et al. An improved shuffled frog-leaping algorithm with extremal optimisation for continuous optimisation[J]. Information Sciences, 2012, 192: 143-151.
[8] ROY P, ROY P, CHAKRABARTI A. Modified shuffled frog leaping algorithm with genetic algorithm crossover for solving economic load dispatch problem with valve-point effect[J]. Applied Soft Computing, 2013, 13(11): 4244-4252.
[9] VAISAKH K, REDDY A S. MSFLA/GHS/SFLA-GHS/SDE algorithms for economic dispatch problem considering multiple fuels and valve point loadings[J]. Applied Soft Computing, 2013, 13(11): 4281-4291.
[10] 罗雪晖, 杨烨, 李霞. 改进混合蛙跳算法求解旅行商问题[J]. 通信学报, 2009, 30(7): 130-135. LUO Xuehui, YANG Ye, LI Xia. Modified shuffled frog-leaping algorithm to solve traveling salesman problem[J]. Journal on Communications, 2009, 30(7): 130-135.
[11] NIKNAM T, FIROUZI B B, MOJARRAD H D. A new evolutionary algorithm for non-linear economic dispatch[J]. Expert Systems with Applications, 2011, 38(10): 13301-13309.
[12] 张潇丹, 胡峰, 赵力, 等. 基于分子动力学模拟的改进混合蛙跳算法[J]. 数据采集与处理, 2012, 27(3): 327-332. ZHANG Xiaodan, HU Feng, ZHAO Li, et al. Improved shuffled frog leaping algorithm based on molecular dynamics simulations[J]. Journal of Data Acquisition & Processing, 2012, 27(3): 327-332.
[13] SUN Hui, ZHAO Jia. Application of particle sharing based particle swarm frog leaping hybrid optimization algorithm in wireless sensor network coverage optimization[J]. Journal of Information and Computational Science, 2011, 8(14): 3181-3188.
[14] 汤可宗. 遗传算法与粒子群优化算法的改进及应用研究[D]. 南京: 南京理工大学, 2011: 1-100. TANG Kezong. Modifications and application research on genetic algorithm and particle swarm optimization algorithm[D]. Nanjing, China: Nanjing University of Science & Technology, 2011: 1-100.
[15] LIU Yu, QIN Zheng, SHI Zhewen, et al. Center particle swarm optimization[J]. Neurocomputing, 2007, 70(4/5/6): 672-679.
[16] 汤可宗, 柳炳祥, 杨静宇, 等. 双中心粒子群优化算法[J]. 计算机研究与发展, 2012, 49(5): 1086-1094.TANG Kezong, LIU Bingxiang, YANG Jingyu, et al. Double center particle swarm optimization algorithm[J]. Journal of Computer Research and Development, 2012, 49(5): 1086-1094.
[17] YAO Xin, LIU Yong, LIN Guangming. Evolutionary programming made faster[J]. IEEE Transactions on Evolutionary Computation, 1999, 3(2): 82-102.
[18] ZHAN Zhihui, ZHANG Jun, LI Yun, et al. Adaptive particle swarm optimization[J]. IEEE Transactions on Systems Man, and Cybernetics—Part B: Cybernetics, 2009, 39(6): 1362-1381.
[19] ZHU Guopu, KWONG S. Gbest-guided artificial bee colony algorithm for numerical function optimization[J]. Applied Mathematics and Computation, 2010, 217(7): 3166-3173.
[20] WANG Hui, WU Zhijian, RAHNAMAYAN S, et al. Multi-strategy ensemble artificial bee colony algorithm[J]. Information Sciences, 2014, 279: 587-603.
Similar References:

Memo

-

Last Update: 2015-07-15

Copyright © CAAI Transactions on Intelligent Systems