首页> 外文会议>International Computer Engineering Conference >Solving Nonlinear Constrained Optimization Problems Using Hybrid Evolutionary Algorithms
【24h】

Solving Nonlinear Constrained Optimization Problems Using Hybrid Evolutionary Algorithms

机译:用混合进化算法求解非线性约束优化问题

获取原文

摘要

An optimization problem is the problem of finding the best solution from all feasible solutions. Solving optimization problems can be performed by heuristic algorithms or classical optimization methods. The aim of this article is to introduce a hybrid evolutionary algorithm based on Particle Swarm Optimization (PSO) and Genetic Algorithm (GA). The proposed algorithm consists of hybrid iterations. Each hybrid iteration contains two iterations, Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) iteration. The basic idea is to transmit a population which is performed after the Particle Swarm Optimization (PSO) iterations to be the initial population of the first iteration in Genetic Algorithm (GA), and then continue the rest number of Genetic Algorithm (GA) iterations. The final population of Genetic Algorithm (GA) iteration is used as initial population of the Particle Swarm Optimization (PSO) iteration in the next hybrid iteration. The proposed algorithm is tested on 5 well known test problems. Comparison established against other algorithms proves that the proposed algorithm preserve finding the optimal solution while reduces the function evaluations.
机译:优化问题是找到所有可行解决方案的最佳解决方案的问题。可以通过启发式算法或经典优化方法来执行解决优化问题。本文的目的是引入基于粒子群优化(PSO)和遗传算法(GA)的混合进化算法。所提出的算法包括混合迭代。每个混合迭代包含两个迭代,粒子群优化(PSO)和遗传算法(GA)迭代。基本思想是在粒子群优化(PSO)迭代以遗传算法(GA)中的第一迭代的初始群体之后发送群体,然后继续遗传算法(GA)迭代的遗传算法(GA)迭代的初始群体。遗传算法(GA)迭代的最终群体用作下一个混合迭代中的粒子群优化(PSO)迭代的初始群体。该算法在5个众所周知的测试问题上进行了测试。与其他算法建立的比较证明,所提出的算法保留找到最佳解决方案,同时降低了函数评估。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号