期刊文献+

群核进化粒子群优化方法 被引量:4

Swarm-Core Evolutionary Particle Swarm Optimization
下载PDF
导出
摘要 粒子群优化方法(PSO Particle Swarm Optimization)是由 Kennedy和 Eberhart 于 1995年提出的进化计算技术,并成功应用于各类优化问题。其基本思想源于对鸟群捕食等群体行为的研究。本文对标准PSO方法进行了分析,给出了“群核”(Swarm-Core)的概念,并在此基础上,提出了群核进化粒子群优化方法(Swarm-Core EvolutionaryParticle Swarm Optimization,SCEPSO),同时把该方法与其它版本PSO方法进行了比较。试验结果表明:在相同环境下,SCEPSO方法能较好地克服传统PSO方法中的不足,测试结果较其它几个版本的PSO方法有很大提高,是非常有效的。 Particle Swarm Optimization (PSO) method is proposed by Kennedy and Eberhart in 1995, it can be used to solve a wide array of different optimization problem. The PSO idea is inspired by natural concepts such as fish schooling, bird flocking and human social relations. This paper analyzes the traditional PSO method deeply and defines the concept of “Swarm-Core”, based on this concept,Swarm-Core Evolutionary Particle Swarm Optimization (SCEPSO) is proposed,at the same time compares SCEPSO method with other version PSO method under the same condition, the experimental results show that SCEPSO method is very effective and better than other version PSO method obviously.
出处 《计算机科学》 CSCD 北大核心 2005年第8期134-137,共4页 Computer Science
基金 国家自然科学基金(批准号:60175024) 教育部"符号计算与知识工程"重点实验资助
关键词 粒子群方法 最优化问题 粒子群优化 进化 SWARM PSO 计算技术 优化问题 群体行为 版本 Particle swarm optimization, Optimization problem
  • 相关文献

参考文献18

  • 1Eberhart R C, Kennedy J. A new optimizer using particle swarm theory. In: Proc. of the sixth Intl. Symposium on Micro Machine and Human Science. Nagoya Japan, 1995. 39~43.
  • 2Kennedy J, Eberhart R C. Particle Swarm Optimization. In: Proc.IEEE Intl. Conf. on Neural Networks. IEEE Service Center, Piscataway, NJ, Ⅳ. 1942~1948.
  • 3Hirotaka, Yoshida, Kenichi. A particle Swarm Optimization for Reactive Power and Voltage Control Considering Voltage Stability. In: IEEE Intl. Conf. on Intelligent System Applications to Power Systems(ISAP'99) Rio de Janeiro,April, 1999.
  • 4Voss M S, Feng X. Arma Model Selection Using Particle Swarm Optimization and Aic Criteria. In: 2002 15th Triennial World Congress, Barcelona, Spain.
  • 5Parsopoulos K E, Vrahatis M N. Particle Swarm Optimization Method in Multiobjective Problems. In: Proc. of the 2002 ACM Symposium on Applied Computing (SAC 2002), 2002.603~607.
  • 6van den Bergh F,Engelbrecht A P. Cooperative Learning in Neural Networks using Particle Swarm Optimizers. South Africam Computer Journal, 2000,26: 84~90.
  • 7Clerc M. TRIBES-Aparameter Free Particle Swarm Optimizer. http:∥clerc. maurice. free. fr/PSO 2002.
  • 8Hu Xiaohui, Eberhart R C. Adaptive Particle Swarm Optimization: Detection and Response to Dynamic Systems. Computational Intelligence, Hawaii, IEEE Press, May, 2002.
  • 9Salman A. Discrete Particle Swarm Optimization for Heterogeneous Task Assignment Problem. In: Proc. of World Multiconference on Systemics, Cybernetics and Informatics Cybernetics And Informatics (SCI 2001).
  • 10Clerc M. Discrete Particle Swarm Optimization: A Fuzzy Combinatorial Black Box. http:∥clerc. maurice. free. fr/PSO/Fuzzy_Discrete_PSO/Fuzzy_DPSO. htm 2000.

同被引文献49

  • 1窦全胜,周春光,马铭.粒子群优化的两种改进策略[J].计算机研究与发展,2005,42(5):897-904. 被引量:38
  • 2曾立平,黄文奇.一种求解车间作业调度问题的混合邻域结构搜索算法[J].计算机科学,2005,32(5):177-180. 被引量:5
  • 3罗文彩,罗世彬,陈小前,王振国.多方法协作优化算法协作策略研究[J].系统工程与电子技术,2005,27(7):1238-1242. 被引量:7
  • 4Zhang Hong, Li Xiaodong, Li heng, et al. particle swarm optimization-based schemes for resource-constrained project scheduling [J]. Automation in Construction, 2005, 14:393-404
  • 5Pan Q K,Tasgetiren M F,Liang Y C. A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem with makespan criterion[c]//Proceedings of the Inter national Workshop on UK Planning and Scheduling Special Interest Group. London, UK: City University, 2005 : 31-41
  • 6Kennedy J, Eberhard R C, Particle swarm optimization//Proceedings of IEEE International Conference on Neural Networks. Piscataway, NJ, USA, 1995 : 1942-1948
  • 7Li Xiaoping, Wang Qian , Wu Cheng. An Efficient Method for No-Wait Flow Shop Scheduling to Minimize Makespan[J]//Proceedings of the 10th International Conference on Computer Supported Cooperative Work in Design. 2006
  • 8Nawaz M, Enscore E, Ham I. A heuristic algorithm for the m-machine , n-job flow-shop sequencing problem. Omega, 1983, 11:91-95
  • 9Hansen P , Mladenovic N. Variable neighborhood search [J]. Computers in Operations Research,1997 , 24: 1097-1100
  • 10Carlier J. Ordonnancements a contraints disjonctives, R.A. I. R. O. RechercheOperationelle/Oper. Res. , 1978,12 : 333-351

引证文献4

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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