首页> 外文期刊>Mathematical Problems in Engineering >An Efficient Algorithm for Unconstrained Optimization
【24h】

An Efficient Algorithm for Unconstrained Optimization

机译:一种高效的无约束优化算法

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

摘要

This paper presents an original and efficient PSO algorithm, which is divided into three phases: (1) stabilization, (2) breadth-first search, and (3) depth-first search. The proposed algorithm, called PSO-3P, was tested with 47 benchmark continuous unconstrained optimization problems, on a total of 82 instances. The numerical results show that the proposed algorithm is able to reach the global optimum. This work mainly focuses on unconstrained optimization problems from 2 to 1,000 variables.
机译:本文提出了一种原始有效的PSO算法,该算法分为三个阶段:(1)稳定,(2)广度优先搜索和(3)深度优先搜索。提出的算法PSO-3P在47个基准连续无约束优化问题上进行了测试,总共有82个实例。数值结果表明,所提算法能够达到全局最优。这项工作主要关注2到1,000个变量的无约束优化问题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号