首页> 外文会议>IEEE Milan PowerTech >A three-stage multi-year transmission expansion planning using heuristic, metaheuristic and decomposition techniques
【24h】

A three-stage multi-year transmission expansion planning using heuristic, metaheuristic and decomposition techniques

机译:采用启发式,沟培和分解技术的三级多年传输扩展规划

获取原文

摘要

Security and quality of supply continue to be major concern of power system operators. Thus, the expansion of transmission grids is certainly one of the major drivers to achieve this goal. In this scope, this paper presents a three-stage approach to solve the multi-year Transmission Expansion Planning (TEP) problem. This approach uses heuristic algorithms coupled with the Harmony Search (HS) metaheuristic and the Branch & Bound (B&B) algorithm. This hybrid method (HS-B&B) aims at finding the optimal multi-stage investment plan avoiding load shedding over the planning horizon. In this work, the AC-Optimal Power Flow (AC-OPF) is used to model the network as a way to consider the real operation conditions of the system. The method was validated using the Garver and the IEEE RTS 24 bus systems. Results demonstrate the reduction of computational effort without compromising the quality of the TEP.
机译:供应的安全和质量继续是电力系统运营商的主要关注点。因此,传输网格的扩展肯定是实现这一目标的主要驱动因素之一。在此范围内,本文提出了一种解决多年传输扩展规划(TEP)问题的三阶段方法。这种方法使用与和声搜索(HS)成群质和分支和绑定(B&B)算法的启发式算法。这种混合方法(HS-B&B)旨在找到最佳的多阶段投资计划,避免在规划地平线上的负载脱落。在这项工作中,AC-Optimal Power Flow(AC-OPF)用于将网络建模为考虑系统实际操作条件的方式。使用Garver和IEEE RTS 24总线系统进行验证该方法。结果证明了在不影响TEP的质量的情况下减少计算工作。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号