According to the problem of Electromagnetism Mechanism (EM) algorithm which may easily get into local optimal solution and has poor search capability, this paper combined the Limited memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) with chaotic model into EM. The main idea of the algorithm was using the L-BFGS which has high precision, in the later stage of algorithm, and using the chaotic model through the whole algorithm to keep the diversity of population. The tests suggested that the algorithm could jump out from the local optimal solution, had better solution and converged faster than EM, Particle Swarm Optimization (PSO) and particle swarm optimization with Time-Varying Accelerator Coefficients (TVAC). Tests also showed that it could be used in path planning and had better results than both PSO and Ant Colony Optimization (ACO), so the algorithm can be applied to the discrete domain question.
[1] HAN L, WANG Y. Electromagnetism-like mechanism algorithm for unconstrained optimization problem[J]. Acta Electronica Sinica, 2009,37(3):664-668.(韩丽霞,王宇平.解无约束优化问题的类电磁机制算法[J].电子学报,2009,37(3):664-668.) [2] JIANG J, LIU M, LIU Y, et al. Electromagnetism-like mechanism algorithm via dual chaotic search[J]. Journal of Xidian University: Natural Science, 2014,41(5):91-97.(姜建国,刘梦楠,刘永青,等.一种采用双混沌搜索的类电磁机制算法[J].西安电子科技大学学报:自然科学版,2014,41(5):91-97.) [3] GUO Z, WU J. Electromagnetism-like mechanism based fault section diagnosis for distribution network[J]. Proceedings of the Chinese Society for Electrical Engineering, 2010,30(13):34-39.(郭壮志,吴杰康.配电网故障区间定位的仿电磁学算法[J].中国电机学报,2010,30(13):34-39.) [4] XIONG F,YAN H. Optimally sequencing mixed-model assembly lines optimally with skip utility work strategy[J]. Acta Automatica Sinica, 2012,38(2):259-269.(熊福力,严洪森.基于跳跃辅助工作策略的混流装配线排产优化[J].自动化学报,2012,38(2):259-269.) [5] LIU L, LIU H, ZHANG H, et al. Full waveform inversion based on modified quasi-Newton equation[J]. Chinese Journal of Geophysics, 2013,56(7):2447-2451.(刘璐,刘洪, 张衡,等.基于修正拟牛顿公式的全波形反演[J].地球物理学报,2013,56(7):2447-2451.) [6] SUN Y, ZHANG C, GAO J, et al. For constrained non-linear programming: chaotic parallel genetic algorithm with feedback[J]. Chinese Journal of Computers, 2007,30(3):424-430.(孙有发,张成科,高京广,等.带反馈的混沌并行GA及其在非线性约束优化中的应用[J].计算机学报,2007,30(3):424-430.) [7] WU X, YANG Z, ZHAO M. A uniform searching particle swarm optimization algorithm[J]. Acta Electronica Sinica, 2011,39(6):1261-1266.(吴晓军,杨战中,赵明.均匀搜索粒子群算法[J].电子学报,2011,39(6):1261-1266.) [8] WANG W. Particle swarm optimization algorithm and its application[D]. Chengdu: Southwest Jiaotong University, 2012.(王维博.粒子群优化算法研究及其应用[D].成都:西南交通大学,2012.) [9] RATNAWEERA A, HALGAMUGE S K, WATSON H C. Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients[J]. IEEE Transactions on Evolutionary Computation, 2004,8(3):240-255. [10] NOCEDAL L. Updating quasi-newton matrices with limited storage[J]. Mathematics of Computation, 1980,35(1):773-782. [11] SHU J. An authenticated key agreement protocol based on extended chaotic maps[J]. Acta Physica Sinica, 2014,63(5):1-4.(舒剑.基于扩展混沌映射的认证密钥协商协议[J].物理学报,2014,63(5):1-4.) [12] LIU M, CHEN Z, DENG X. Image tamper detection scheme based on chaotic system and fragile watermarking[J]. Journal of Computer Applications, 2013,33(5):1371-1373.(刘敏,陈志刚,邓小鸿.基于混沌和脆弱水印的图像篡改检测算法[J]. 计算机应用,2013,33(5):1371-1373.) [13] LIU L, ZHANG X. Image encryption algorithm based on chaos and bit operations[J]. Journal of Computer Applications, 2013,33(4):1070-1073.(刘乐鹏,张雪锋.基于混沌和位运算的图像加密算法[J].计算机应用,2013,33(4):1070-1073.) [14] LI Y, CHI Y, WEN T. A dynamic boundary based particle swarm optimization[J]. Acta Electronica Sinica, 2013,41(5):865-870.(李迎秋,迟玉红,温涛.一种基于动态边界的粒子群优化算法[J].电子学报,2013,41(5):865-870.) [15] ZHANG W, ZHANG X, LI Y. Path planning for intelligent robots based on improved particle swarm optimization algorithm[J]. Journal of Computer Applications, 2014,34(2):510-513.(张万绪,张向兰,李莹.基于改进粒子群算法的智能机器人路径规划[J].计算机应用,2014,34(2):510-513.)
2015, Vol. 35 
