首页> 外文期刊>International Journal of Computers & Applications >Interleaving of particle swarm optimization and differential evolution algorithm for global optimization
【24h】

Interleaving of particle swarm optimization and differential evolution algorithm for global optimization

机译:全局优化的粒子群优化与差分进化算法交织

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

摘要

Stochastic optimization algorithms have potential to solve optimization problems in various fields of engineering and science. However, increasing non-linearity, non convexity, multi-modality, discontinuity, and even dynamics make the problems more complex and intractable. Classical optimization techniques are not able to determine global solution by analyzing rough non-linear surfaces. Heuristic algorithms have been used for determining global solution for this type of problems. However, heuristic algorithm is knowledge dependent, so finding a unique heuristic optimization algorithm for obtaining optimum solutions for all problems is not feasible. Hybridization is an integrated framework where merits of algorithms are utilized to improve performance of the optimizers. Particle Swarm Optimization (PSO) and Differential Evolution (DE) algorithm are two heuristic algorithms despite certain shortcomings have been applied to solve global optimization problems. In this paper, we propose an integrated framework where improved version of PSO and DE (IPSODE) is executed in interleaved fashion for balancing exploration and exploitation dilemma in the evolution process. In IPSODE algorithm, generation starts with improved PSO and switch to either improved DE or continue with improved PSO based on the fitness value. The algorithm is experimented on 20 benchmark/test functions which are uni modal, multi-modal, shifted, and rotated with 10, 20, and 30 different dimensions. The performance of the proposed method is confirmed by comparing with basic PSO, basic DE, and three hybridization methods of PSO and DE based on evaluation criteria like solution quality, robustness, convergence speed, scalability, and statistical t-test.
机译:随机优化算法具有解决工程和科学各个领域中优化问题的潜力。但是,非线性,非凸性,多模态,不连续性甚至动态性的增加使问题变得更加复杂和棘手。经典的优化技术无法通过分析粗糙的非线性表面来确定整体解。启发式算法已用于确定此类问题的整体解决方案。但是,启发式算法是依赖于知识的,因此寻找一种独特的启发式优化算法来获得所有问题的最优解是不可行的。杂交是一个集成的框架,其中利用算法的优点来提高优化程序的性能。尽管已应用某些缺点来解决全局优化问题,但粒子群优化(PSO)和差分进化(DE)算法是两种启发式算法。在本文中,我们提出了一个集成框架,其中以交错方式执行PSO和DE的改进版本(IPSODE),以平衡演化过程中的探索和开发困境。在IPSODE算法中,基于适应性值,生成从改进的PSO开始,然后切换到改进的DE或从改进的PSO继续。该算法在20种基准/测试功能上进行了实验,这些功能是单模态,多模态,移位和旋转(具有10、20和30个不同的尺寸)。通过与基本PSO,基本DE以及基于解决方案质量,鲁棒性,收敛速度,可扩展性和统计t检验等评估标准的PSO和DE的三种杂交方法进行比较,验证了该方法的性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号