首页> 外文会议>IEEE International Conference on Advanced Computational Intelligence >A hybrid pattern search method for solving unconstrained optimization problems
【24h】

A hybrid pattern search method for solving unconstrained optimization problems

机译:一种求解无约束优化问题的混合模式搜索方法

获取原文

摘要

In solving engineering optimization problems, the current Evolutionary Programming (EP) has slow convergence rateson mostproblems, and if thereis more than one local optimum in the problem, theobtained optimal solution may not necessarily be the global optimum. This paper describes a new approach for solving unconstrained optimization problems with either discreteor continuous design variables. The proposed approach is a pattern search method that is based on univariate search hybridized with the Shaking Optimization Algorithm “SOA”. The computational analysis shows that, for the selected benchmark problems, the proposed approach is a powerful search and optimization technique that may yield better solutions toengineering problems than those obtained using current algorithms for both the solution efficiency and the number of iterations.
机译:在解决工程优化问题时,当前进化编程(EP)具有缓慢的收敛速度,大多数问题,如果存在多于一个本地最佳的最佳问题,则TheTobtination的最佳解决方案可能不一定是全局最优的。 本文介绍了一种解决不受限制的连续设计变量的无约束优化问题的新方法。 所提出的方法是一种模式搜索方法,其基于用摇动优化算法杂交的单变量搜索“ soa” 计算分析表明,对于所选择的基准问题,所提出的方法是一种强大的搜索和优化技术,可以产生比使用当前算法获得的解决方案效率和迭代次数获得的解决方案的优化技术。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号