首页> 外文期刊>Applied Soft Computing >Application of modified pigeon-inspired optimization algorithm and constraint -objective sorting rule on multi-objective optimal power flow problem
【24h】

Application of modified pigeon-inspired optimization algorithm and constraint -objective sorting rule on multi-objective optimal power flow problem

机译:改进的鸽子启发优化算法的应用和约束 - 非目标速率排序规则对多目标最佳功率流出问题

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

摘要

To solve the non-differentiable optimal power flow (OPF) problems with multiple contradictory objectives, a modified pigeon-inspired optimization algorithm (MPIO) is put forward in this paper. Combining with the common-used penalty function method (PFM), the MPIO-PFM algorithm is proposed and applied to optimize the active power loss, emission and fuel cost (with valve-point loadings) of power system. Eight simulation trials carried out on MATLAB software validate MPIO-PFM algorithm can obtain superior Pareto Frontier (PF) comparing with the typical NSGA-II algorithm. Nevertheless, some Pareto solutions obtained by MPIO-PFM algorithm cannot satisfy all system constraints due to the difficulty in choosing the proper penalty coefficients. Thus, an innovative approach named as constraint-objective sorting rule (COSR) is presented in this paper. The bi-objective and tri-objective trials implemented on IEEE 30-node, 57-node and 118-node systems demonstrate that the Pareto optimal set (POS) obtained by MPIO-COSR algorithm realizes zero-violation of various system constraints. Furthermore, the generational-distance and hyper-volume indexes quantitatively illustrate that in contrast to NSGA-II and MPIO-PFM methods, the MPIO-COSR algorithm can determine the evenly-distributed PFs with satisfactory-diversity. The intelligent MPIO-COSR algorithm provides an effective way to handle the non-convex MOOPF problems. (C) 2020 Elsevier B.V. All rights reserved.
机译:为了解决多种矛盾目标的不可微分的最佳功率流(OPF)问题,本文提出了一种改进的鸽子启发优化算法(MPIO)。结合共同使用的惩罚功能方法(PFM),提出了MPIO-PFM算法和应用,以优化电力系统的有源功率损耗,发射和燃料成本(带阀点加载)。在MATLAB软件上进行的八种模拟试验验证MPIO-PFM算法可以获得与典型的NSGA-II算法相比的卓越的帕累托前沿(PF)。然而,由于选择适当的惩罚系数,MPIO-PFM算法获得的一些通过MPIO-PFM算法获得的帕累托解决方案不能满足所有系统约束。因此,本文提出了一种创新的方法,命名为约束 - 客观分类规则(COSR)。在IEEE 30节点,57节点和118节点系统上实现的双目标和三目标试验表明,通过MPIO-COSR算法获得的Pareto最佳集合(POS)实现了对各种系统约束的零违反。此外,本代式 - 距离和超容量索引定量地说明了与NSGA-II和MPIO-PFM方法相比,MPIO-COSR算法可以以满意的多样性确定均匀分布的PFS。智能MPIO-COSR算法提供了处理非凸MoOPF问题的有效方法。 (c)2020 Elsevier B.V.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号