[1]Eusuff M, Lansey K E. Optimization of water distribution network design using the shuffled frog leaping algorithm[J]. Water Resources Planning and Management,2003,129 (3):210225.
[2]He Bing, Che Linxian, Liu Chusheng. Novel hybrid shuffled frog leaping and differential evolution algorithm[J]. Computer Engineering and Applications,2011,47(18):48. (in Chinese)
[3]Luo Jianping, Chen Minrong. Study on trajactory and convergence analysis of shuffled frog leaping algorithm and its improved algorithm[J]. Signal Processing, 2010,26(9):14281433. (in Chinese)
[4]Li Z F, Zhou Y, Cheng P. An improved shuffled frog leaping algorithm for knapsack problem[J]. Advances in Intelligent and Soft Computing,2012(169):299303.
[5]Dai Yongqiang, Wang Lianguo, Shi Qiuhong, et al. Performance analysis of improved SFLA and the application in economic dispatch of power system[J]. Power System Protection and Control, 2012,40(10):7783. (in Chinese)
[6]Sun Hui, Long Teng, Zhao Jia. Swarm intelligence algorithm based on combination of shuffled frog leaping algorithm and particle swarm optimization[J]. Journal of Computer Applications, 2012,32(2):428431. (in Chinese)
[7]Zhang J M, Wu C C. Improved shuffled frog leaping algorithm and its application[J]. Applied Mechanics and Materials, 2012(155/156):9296.
[8]Zheng Shilian,Lou Caiyi,Yang Xiaoniu.Cooperative spectrum sensing for congnitive radios based on a modified shuffled frog leaping algorithm[J]. Acta Physica Sinica, 2010,59(5):36113617. (in Chinese)
[9]Zhao Pengjun, Liu Sanyang. Shuffled frog leaping algorithm for solving complex functions[J]. Application Research of Computers, 2009,26(7):24352437. (in Chinese)
附中文参考文献:
[2]何兵,车林仙,刘初升.一种蛙跳和差分进化混合算法[J].计算机工程与应用,2011,47(18):48.
[3]骆剑平,陈泯融.混合蛙跳算法及其改进算法的运动轨迹及收敛性分析[J].信号处理,2010,26(9):14281433.
[5]代永强,王联国,施秋红,等.改进的混合蛙跳算法性能分析及其在电力系统经济调度中的应用[J].电力系统保护与控制,2012,40(10):7783.
[6]孙辉,龙腾,赵嘉.基于微粒群与混合蛙跳融合的群体智能算法[J].计算机应用,2012,32(2):428431.
[8]郑仕链,楼才义,杨小牛. 基于改进混合蛙跳算法的认知无线电协作频谱感知[J].物理学报,2010,59(5):36113617.
[9]赵鹏军,刘三阳.求解复杂函数优化问题的混合蛙跳算法[J].计算机应用研究,2009,26(7):24352437. |