首页> 外文会议>International Conference on Information and Computing >Study of the Application of Election- Survey Algorithm for Nonlinear Constrained Optimization Problems
【24h】

Study of the Application of Election- Survey Algorithm for Nonlinear Constrained Optimization Problems

机译:选举调查算法在非线性约束优化问题中的应用研究

获取原文

摘要

For the nonlinear constrained optimization problems, election-survey algorithm is combined with dynamic penalty function method to get the optimum in order to demonstrate solving capability of the algorithm. The tests of classic function and engineering optimization application model show that the election-survey algorithm can constringe rapidly to global optimal solution and achieve better optimization solution of objective function. It is feasible and effective in solving nonlinear constrained optimal problems, and available for engineering optimization.
机译:对于非线性约束优化问题,竞选调查算法与动态惩罚功能方法组合以获得最佳,以便展示算法的求解能力。经典函数和工程优化应用模型的测试表明,选举调查算法可以迅速地限制为全局最优解决方案,实现客观函数的更好优化解决方案。在解决非线性受限的最佳问题上是可行的并且有效的,可用于工程优化。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号