期刊文献+

透镜成像反学习策略在粒子群算法中的应用 被引量:28

The Application of a Novel OBL Based on Lens Imaging Principle in PSO
下载PDF
导出
摘要 在PSO中引入反向学习策略(Opposite-Based Learning)可使粒子在搜寻过程中总能找到当前解的反向位置,增加了接近全局最优解的机会.然而,OBL仅在演化初期作用显著,在演化后期则需通过变异等手段来提高其"开发"能力.针对该问题,基于透镜成像原理,引入缩放因子和搜索半径两个可调参数进一步平衡了算法的"探索"和"开发"能力.实验表明该策略能够提高种群多样性和收敛性能. By introducing opposition-based learning (OBL) in PSO ,particles are enabled to find an opposite position that is closer to the global optimization solution .However ,OBL only makes a good performance on the initial phrase of the evolution , while at later stages it needs to be combined with other techniques (e .g .Cauchy mutation ) to improve its ability of“exploration” . In this paper ,a novel OBL based on the principle of lens imaging is proposed .It uses two parameters (i .e .,zoom factor and the factor of search radius ) ,which will achieve a better balance between PSO’s“exploration”and“exploitation”abilities .The simula-tion shows that the novel OBL possesses better convergence rate and convergence effect .
出处 《电子学报》 EI CAS CSCD 北大核心 2014年第2期230-235,共6页 Acta Electronica Sinica
基金 国家自然科学基金(No.61070009) 国家科技支撑计划(No.2012BAH25F02) 江西省自然(青年)科学基金(No.2012BAB211036)
关键词 反向学习 粒子群算法 透镜成像 opposite-based learning particle swarm optimization imaging lenses
  • 相关文献

参考文献14

  • 1Kennedy J, Eberhart R C. Particle swarm optimization[ A]. Pro- ceedings of IEEE International Conference on Neural Networks [ C]. Perth, Australia, 1995.1942 - 1948.
  • 2田野,刘大有.求解流水车间调度问题的混合粒子群算法[J].电子学报,2011,39(5):1087-1093. 被引量:18
  • 3Z Zheng,Hock Soon S, Jixiang S.A hybrid particle swarm op- timization with cooperative method for multi-object tracking [ A ]. Congress on Evolutionary Computation ( CEC' 2012 )[ C]. Washington, D C, USA: lEEr:. Press,2012.1 - 6.
  • 4G Yue-Jiao, Z Jun, H S Chang. An efficient resource allocation scheme using particle swarm optimization [ J ]. IEEF. Transac- tions on Evolutionary Computation, 2012,16 ( 6 ) : 801 - 816.
  • 5Tizhoosh H R. Opposition-based learning: A new scheme for machine intelligence[ A ]. Proceedings of International Confer- ence on the Computational Intelligence for Modelling, Control and Automation, 2005 and International Conference on Intelli- gent Agents, Web Technologies and Internet Commerce [ C ]. Washington, D C, USA: IEEE Press,2005.695 - 701.
  • 6Rahnamayan S, Tizhoosh H R, M M A Salama. Opposition- based differential evolution [ J ]. IEEE Transactions on Evolu- tionary Computation, 2008,12(1) :64 - 79.
  • 7H Lin, H Xing-shi. A Novel opposition-based particle swarm optimization for noisy problems [ A ]. Pree.edings of Interna- tional Conference on the Natural Computation[ C]. Piscataway:IEEE Press, 2007.624 - 629.
  • 8W Hui, L H hui, L Yong. Opposition-based particle swarm al- gorithm with cauchy mutation [ A ]. Congress on Evolutionary Computation (CEC' 2007 ) [ C ]. Washington, D C, USA: IEEE Press, 2007.4750 - 4756.
  • 9Wang H,Wu Z,Rahnarnayan S. Enhancing particle swarm op- timization using generalized oppositionbased leaming[ J]. Infor- marion Sciences, 2011,181(20) :4699 - 4714.
  • 10Wang H, Wu Z, Rahnamayan S. Diversity Analysis of Opposi- tion-Based Differential Evolution-an Experimental Study [ M ]. Advances in Computation and Intelligence, Springer Berlin Heidelberg,2010.95 - 102.

二级参考文献18

  • 1赫然,王永吉,王青,周津慧,胡陈勇.一种改进的自适应逃逸微粒群算法及实验分析[J].软件学报,2005,16(12):2036-2044. 被引量:134
  • 2周驰,高亮,高海兵.基于PSO的置换流水车间调度算法[J].电子学报,2006,34(11):2008-2011. 被引量:24
  • 3Garey M R, Johnson D S,Sethi R. The complexity of flowshop and job shop scheduling [J].Mathematics of Operations Research, 1976,1 (2) ~ 117 - 129.
  • 4Eberhart R C, Kennedy J. A new optimizer using particle swarm theory[ A]. Proceedings of the Sixth International Sym- posium on Micro Machine and Human Science[C]. Nagoya, Japan, 1995.39 - 43.
  • 5Tasgetiren M F, Sevkli M, Liang Y C, Gencyilmaz G. Particle swarm optimization algorithm for permutation flowshop se- quencing problem [A]. Lecture Notes in Computer Science [C]. Berlin Heidelberg: Springer-Verlag, vol. 3172, 2004. 382 - 389.
  • 6Tasgetiren M F,Liang Y C, Sevkli M,et al.A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem[J].European Journal of Operational Research, 2007, 177 (3) : 1930 - 1947.
  • 7Liao C J, Tseng C T, Luarn P. A discrete version of particle swarm optimization for flowshop scheduling problems [ J ]. Computers & Operations Research,2007,34(10) :3099 - 3111.
  • 8Lian Z G, Gu X S, Jiao B. A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan[ J]. Applied Mathematics and Computation, 2006, 175(1) :773 - 785.
  • 9Lian Z G, Gu X S, Jiao B. A novel particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan[ J]. Chaos, Solitons and Fractals,2008,35 (5) :851 - 861.
  • 10Ruiz R, Stiitzle T. A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem [ J 1. European Journal of Operational Research,2007,177(3):2033 - 2049.

共引文献63

同被引文献176

引证文献28

二级引证文献276

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部