首页> 外文期刊>Mathematical Problems in Engineering >On the Theoretical Analysis of the Plant Propagation Algorithms
【24h】

On the Theoretical Analysis of the Plant Propagation Algorithms

机译:植物繁殖算法的理论分析

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

摘要

Plant Propagation Algorithms (PPA) are powerful and flexible solvers for optimisation problems. They are nature-inspired heuristics which can be applied to any optimisation/search problem. There is a growing body of research, mainly experimental, on PPA in the literature. Little, however, has been done on the theoretical front. Given the prominence this algorithm is gaining in terms of performance on benchmark problems as well as practical ones, some theoretical insight into its convergence is needed. The current paper is aimed at fulfilling this by providing a sketch for a global convergence analysis.
机译:植物传播算法(PPA)是用于优化问题的强大而灵活的求解器。它们是自然启发式启发法,可以应用于任何优化/搜索问题。关于PPA的研究越来越多,主要是实验性的。但是,在理论方面几乎没有做任何事情。鉴于该算法在基准问题和实际问题上的性能都得到了显着提高,因此需要对其收敛性有一些理论上的了解。本白皮书旨在通过提供全局收敛性分析的草图来实现这一目标。

著录项

  • 来源
    《Mathematical Problems in Engineering》 |2018年第3期|6357935.1-6357935.8|共8页
  • 作者单位

    Abdul Wali Khan Univ Mardan, Dept Math, Khyber Pakhtunkhwa, Pakistan;

    Univ Essex, Dept Math Sci, Wivenhoe Pk, Colchester CO4 3SQ, Essex, England;

    Abdul Wali Khan Univ Mardan, Dept Math, Khyber Pakhtunkhwa, Pakistan;

    Abdul Wali Khan Univ Mardan, Dept Math, Khyber Pakhtunkhwa, Pakistan;

    KUST, Dept Math, Khyber Pakhtunkhwa, Pakistan;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号