...
首页> 外文期刊>Electric power systems research >Multi-step Simultaneous Changes Constructive Heuristic Algorithm For Transmission Network Expansion Planning
【24h】

Multi-step Simultaneous Changes Constructive Heuristic Algorithm For Transmission Network Expansion Planning

机译:传输网络扩展规划的多步同时变化构造启发式算法

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

摘要

In this paper, a Constructive Heuristic Algorithm (CHA) is presented to solve the Transmission Network Expansion Planning Problem (TNEP), a complex non-convex Mixed Integer Non-Linear Programming (MINLP) problem with multiple local minima. In the proposed algorithm, the non-linearities are resolved through the following feature: when discrete decision variables are given, the model becomes linear in the continuous variables. A CHA is developed which improves the current solution by implementing multiple step simultaneous changes over a number of saturated transmission lines, in contrast to the approach traditionally followed, which implements one change at a time. Solutions to test problems are computed.
机译:本文提出了一种构造启发式算法(CHA)来解决传输网络扩展规划问题(TNEP),这是一个具有多个局部极小值的复杂的非凸混合整数非线性规划(MINLP)问题。在提出的算法中,通过以下特征解决了非线性问题:当给出离散决策变量时,模型在连续变量中变为线性。与传统上采用的每次执行一个更改的方法相比,开发了一种CHA,通过在多个饱和传输线上执行多步同时更改来改进当前解决方案。计算测试问题的解决方案。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号