...
首页> 外文期刊>Structural and Multidisciplinary Optimization >Improving solution characteristics of particle swarm optimization using digital pheromones
【24h】

Improving solution characteristics of particle swarm optimization using digital pheromones

机译:使用数字信息素改善粒子群算法的求解特性

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

摘要

In this paper, a new approach to particle swarm optimization (PSO) using digital pheromones to coordinate swarms within an n-dimensional design space is presented. In a basic PSO, an initial randomly generated population swarm propagates toward the global optimum over a series of iterations. The direction of the swarm movement in the design space is based on an individual particle’s best position in its history trail (pBest), and the best particle in the entire swarm (gBest). This information is used to generate a velocity vector indicating a search direction toward a promising location in the design space. The premise of the research presented in this paper is based on the fact that the search direction for each swarm member is dictated by only two candidates—pBest and gBest, which are not efficient to locate the global optimum, particularly in multi-modal optimization problems. In addition, poor move sets specified by pBest in the initial stages of optimization can trap the swarm in a local minimum or cause slow convergence. This paper presents the use of digital pheromones for aiding communication within the swarm to improve the search efficiency and reliability, resulting in improved solution quality, accuracy, and efficiency. With empirical proximity analysis, the pheromone strength in a region of the design space is determined. The swarm then reacts accordingly based on the probability that this region may contain an optimum. The additional information from pheromones causes the particles within the swarm to explore the design space thoroughly and locate the solution more efficiently and accurately than a basic PSO. This paper presents the development of this method and results from several multi-modal test cases.
机译:在本文中,提出了一种使用数字信息素在n维设计空间内协调群体的粒子群优化(PSO)的新方法。在基本的PSO中,初始随机生成的总体群通过一系列迭代向全局最优方向传播。群在设计空间中的运动方向基于单个粒子在其历史轨迹中的最佳位置(pBest),以及整个群中的最佳粒子(gBest)。该信息用于生成速度矢量,该速度矢量指示朝向设计空间中有希望的位置的搜索方向。本文提出研究的前提是基于这样一个事实,即每个群体成员的搜索方向仅由两个候选者(pBest和gBest)决定,它们不能有效地定位全局最优,特别是在多模式优化问题中。另外,在优化的初始阶段,由pBest指定的不良移动集可能会使群集陷入局部最小值或导致收敛缓慢。本文介绍了使用数字信息素来辅助群体内的通信以提高搜索效率和可靠性,从而提高解决方案的质量,准确性和效率。通过经验接近分析,可以确定设计空间区域内的信息素强度。然后,基于该区域可能包含最优值的可能性,群体做出相应的反应。来自信息素的附加信息使群内的粒子能够彻底探索设计空间,并比基本的PSO更有效,更准确地定位解决方案。本文介绍了这种方法的发展,并从几个多模式测试案例中得出了结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号