一种利用动态搜索策略的混合蛙跳算法

doi:10.3969/j.issn.1001-2400.2014.04.010

J4 ›› 2014, Vol. 41 ›› Issue (4): 51-57.doi: 10.3969/j.issn.1001-2400.2014.04.010

一种利用动态搜索策略的混合蛙跳算法

姜建国;张丽媛;苏仟;邓凌娟;刘梦楠

(西安电子科技大学计算机学院，陕西西安 710071)

收稿日期:2013-03-12 出版日期:2014-08-20 发布日期:2014-09-25
通讯作者: 姜建国
作者简介:姜建国(1956- )，男，教授， E-mail: jgjiang@mail.xidian.edu.cn．
基金资助:
国家部委基础科研计划资助项目(A1120132007)

Shuffled frog leaping algorithm using dynamic searching strategy

JIANG Jianguo;ZHANG Liyuan;SU Qian;DENG Lingjuan;LIU Mengnan

(School of Computer Science and Technology, Xidian Univ., Xi'an 710071， China)

Received:2013-03-12 Online:2014-08-20 Published:2014-09-25
Contact: JIANG Jianguo

摘要/Abstract

摘要：

从混合蛙跳算法的寻优原理出发，研究了其寻优机制．针对标准算法中存在的初始种群不均匀、迭代后期收敛速度慢，易陷入局部最优的缺陷，提出了一种改进的混合蛙跳算法．采用随机化均匀设计方法产生初始种群;引入影响因子，动态地改变子群当前最差值对其进化行为的影响;根据群体适应度方差判断种群是否陷入局部最优，并通过对当前全局最优值微扰，使算法跳出局部最优．实验结果表明，改进算法有更高的收敛精度和更好的收敛结果．

关键词: 混合蛙跳算法, 随机化均匀设计, 影响因子, 群体适应度方差, 微扰

Abstract:

Based on the principle of the shuffled frog leaping algorithm (SFLA), the algorithm's optimization mechanism is studied. A novel shuffled frog leaping algorithm is proposed to solve the problems of the original SFLA, such as non-uniform initial population, slow convergence speed in later iterations, and being easy to fall into local optimum. The improved algorithm generates the initial population with the random uniform design method, changes the influence of the subgroup's current worst value on the subsgroup's evolution behavior dynamically by using the influence factor. Besides, the variance of the population's fitness is calculated to judge whether the population falls into local optimum, and then the improved algorithm makes the population jump out of local optimal state by the perturbation of the current global optimal value. Experimental results show that the improved algorithm can lead to a higher convergence accuracy and a better convergence result.

Key words: shuffled frog leaping algorithm, random uniform design, influence factor, the variance of the population's fitness, perturbation

中图分类号:

TP301.6

姜建国;张丽媛;苏仟;邓凌娟;刘梦楠. 一种利用动态搜索策略的混合蛙跳算法[J]. J4, 2014, 41(4): 51-57.

JIANG Jianguo;ZHANG Liyuan;SU Qian;DENG Lingjuan;LIU Mengnan. Shuffled frog leaping algorithm using dynamic searching strategy[J]. J4, 2014, 41(4): 51-57.

参考文献

［1］ Eusuff M, Lansey K, Pasha F. Shuffled Ffrog-leaping Algorithm: a Memetic Meta-heuristic for Discrete Optimization［J］. Engineering Optimization, 2006, 38(2): 129-154.
［2］姜建国, 李锦, 龙秀萍, 等. 采用小生境技术的混合蛙跳算法［J］. 计算力学学报, 2012, 29(6): 960-965.
Jiang Jianguo, Li Jin, Long Xiuping, et al. Shuffled Frog Leaping Algorithm Using Niche Technology ［J］. Chinese Journal of Computational Mechanics, 2012, 29(6): 960-965.
［3］赵鹏军, 邵泽军. 一种新的改进的混合蛙跳算法［J］. 计算机工程与应用, 2012, 48(8): 48-50.
Zhao Pengjun, Shao Zejun. Novel Improved Shuffled Frog Leaping Algorithm ［J］. Computer Engineering and Applications, 2012, 48(8): 48-50.
［4］ Elbeltagi E, Hegazy T, Grierson D. A Modified Shuffled Frog-leaping Optimization Algorithm: Applications to Project Management［J］. Structure and Infrastructure Engineering, 2007, 3(1): 53-60.
［5］葛宇, 王学平, 梁静. 自适应混沌变异蛙跳算法［J］. 计算机应用研究, 2011, 28(3): 945-947.
Ge Yu, Wang Xueping, Liang Jing. Adaptive Chaotic Mutation Shuffled Frog Leaping Algorithms［J］. Application Research of Computers, 2011, 28(3): 945-947.
［6］任哲, 周本达, 陈明华. 一种基于随机化均匀设计点集的遗传算法用于求解 MVCP［J］. 模式识别与人工智能, 2010, 23(2): 284-288.
Ren Zhe, Zhou Benda, Chen Minghua. A Genetic Algorithm Based on Random Uniform Design Point Set for Solving MVCP［J］. Pattern Recognition and Artificial Intelligence, 2010, 23(2): 284-288.
［7］ Luo P, Lu Q, Wu C. Modified Shuffled Frog Leaping Algorithm Based on New Searching Strategy［C］//7th International Conference on Natural Computation. Piscataway: IEEE, 2011: 1346-1350.
［8］吕振肃, 侯志荣. 自适应变异的粒子群优化算法［J］. 电子学报, 2004, 32(3): 416-420.
Lü Zhenxiao, Hou Zhirong. Particle Swarm Optimization with Adaptive Mutation［J］. Acta Electronica Sinica, 2004, 32(3): 416-420.
［9］巩敦卫, 朱美强, 郭西进, 等. 一种新的基于混沌变异解决早熟收敛的遗传算法［J］. 控制与决策, 2003, 18(6): 686-689.
Gong Dunwei, Zhu Meiqiang, Guo Xijin, et al. Genetic Algorithm Based on Chaotic Mutation to Deal with Premature Convergence［J］. Control and Decision, 2003, 18(6): 686-689.
［10］金荣洪, 袁智皓, 耿军平, 等. 基于改进粒子群算法的天线方向图综合技术［J］. 电波科学学报, 2006, 21(6): 873-878.
Jin Ronghong, Yuan Zhihao, Geng Junping, et al. The Pattern Synthesis of Antennas Based on a Modified PSO Algorithm［J］. Chinese Journal of Radio Science, 2006, 21(6): 873-878.
［11］姜建国, 田旻, 王向前, 等. 采用扰动加速因子的自适应粒子群优化算法［J］. 西安电子科技大学学报, 2012, 39(4): 93-101.
Jiang Jianguo, Tian Min, Wang Xiangqian, et al. Adaptive Particle Swarm Optimization via Disturbing Acceleration Coefficents ［J］. Journal of Xidian University, 2012, 39(4): 93-101.

[1]	臧明相;王勐;周文宏;陈会仓. 改进混合蛙跳优化的片上网络低功耗映射算法[J]. J4, 2015, 42(1): 118-123.
[2]	侯建强;牛中奇. 终端天线性能一致性检测系统研究[J]. J4, 2009, 36(4): 675-679.
[3]	任新成1;2;郭立新1. 一维带限Weierstrass分形分层介质粗糙面电磁散射研究 [J]. J4, 2009, 36(2): 322-330.
[4]	任新成1;2;郭立新1. 一维带限Weierstrass分形粗糙面透射波散射系数特征研究 [J]. J4, 2007, 34(4): 590-595.
[5]	暂时无作者信息. 单电子晶体管隧穿电阻的量子计算[J]. J4, 2002, 29(3): 314-319.

一种利用动态搜索策略的混合蛙跳算法

Shuffled frog leaping algorithm using dynamic searching strategy

PDF (PC)

赞

可视化

被引次数

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 5

Metrics

本文评价

推荐阅读 10