首页> 外文会议>International Symposium on Intelligence Computation amp; Applications(ISICA'2007); 20070921-23; Wuhan(CN) >A Fast Particle Swarm Optimization Algorithm with Cauchy Mutation and Natural Selection Strategy
【24h】

A Fast Particle Swarm Optimization Algorithm with Cauchy Mutation and Natural Selection Strategy

机译:具有柯西突变和自然选择策略的快速粒子群优化算法

获取原文
获取原文并翻译 | 示例

摘要

The standard Particle Swarm Optimization (PSO) algorithm is a novel evolutionary algorithm in which each particle studies its own previous best solution and the group's previous best to optimize problems. One problem exists in PSO is its tendency of trapping into local optima. In this paper, a fast particle swarm optimization (FPSO) algorithm is proposed by combining PSO and the Cauchy mutation and an evolutionary selection strategy. The idea is to introduce the Cauchy mutation into PSO in the hope of preventing PSO from trapping into a local optimum through long jumps made by the Cauchy mutation. FPSO has been compared with another improved PSO called AMPSO [12] on a set of benchmark functions. The results show that FPSO is much faster than AMPSO on all the test functions.
机译:标准粒子群优化(PSO)算法是一种新颖的进化算法,其中每个粒子都研究其自己先前的最佳解决方案,并研究该组先前的最佳解决方案。 PSO中存在的一个问题是其陷入局部最优状态的趋势。本文提出了一种结合粒子群算法和柯西突变的快速粒子群优化算法,并提出了一种进化选择策略。想法是将Cauchy突变引入PSO,以防止PSO通过Cauchy突变引起的跳远而陷入局部最优状态。 FPSO已在一组基准功能上与另一种改进的PSO(称为AMPSO [12])进行了比较。结果表明,在所有测试功能上,FPSO比AMPSO快得多。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号