首页> 外文会议>Chinese Control and Decision Conference >Solving Multiobjective Optimal Reactive Power Dispatch Using Improved Multiobjective Particle Swarm Optimization
【24h】

Solving Multiobjective Optimal Reactive Power Dispatch Using Improved Multiobjective Particle Swarm Optimization

机译:使用改进的多目标粒子群优化解决多目标最佳无功功率调度

获取原文

摘要

In this paper, a novel improved multiobjective particle swarm optimization (IMOPSO) is proposed for solving the optimal reactive power dispatch (ORPD) problem with multiple and competing objectives. In order to improve the global search capability and the nondominated solutions diversity, time variant parameters, mutation operator, and dynamic crowding distance are incorporated into the MOPSO algorithm. In addition, multiple powerful strategies, such as mixed-variable handling approach, constraint handling technique and stopping criteria, are employed. The propose IMOPSO is validated on the standard IEEE 30-bus and IEEE 118-bus systems, and compared with MOPSO and nondominated sorting genetic algorithm (NSGA-II) using performance metrics with respect to convergence, diversity, and computational time. The numerical results demonstrate the superiority of the proposed IMOPSO in solving the ORPD problem while strictly satisfying all the constraints.
机译:在本文中,提出了一种新颖的改进的多目标粒子群优化(IMOPSO),用于解决多次和竞争目标的最佳无功功率调度(ORPD)问题。为了改善全球搜索能力和NondoMinated解决方案的多样性,时间变量参数,突变算子和动态拥挤距离被纳入MOPSOSO算法。另外,采用多种强大的策略,例如混合可变处理方法,约束处理技术和停止标准。该提议IMOPSO在标准IEEE 30-BUR和IEEE 118总线系统上验证,并与MOPSO和NondoMinated分类遗传算法(NSGA-II)相比,使用性能度量相对于收敛,分集和计算时间。数值结果证明了所提出的IMOPSO在求解ORPD问题时的优越性,同时严格满足所有约束。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号