• 主题
高级搜索  >
历史搜索 清空历史
首页> 美国政府科技报告 >Use of Generalized Network Flow Programming in Solving the Optimal Power Flow Problem
【24h】

Use of Generalized Network Flow Programming in Solving the Optimal Power Flow Problem

机译：广义网络流程编程在求解最优潮流问题中的应用

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The Optimal Power Flow problem is important in both system planning and operating environments. Due to the complexity in implementation and extensive execution times of existing OPF computer programs, there exists the need for a faster, simpler solution technique which provides reasonable accuracy for system control centers or other environments where speed is critical. A formulation of this type is available through the use of Generalized Network Flow Programming (GNFP). The methodology for applying GNFP to the OPF problem has been developed and demonstrated in this dissertation using three examples - a simple 5 bus system, a 39 bus system, and an actual 376 bus equivalent system which includes Houston Lighting & Power (HL&P) Company. An equivalent system is one in which the areas outside the primary system are represented by smaller networks. For example, the 12 outside areas in the HL&P data actually contain over 1000 busses. But, through the manipulation of impedances, they can be reduced to a few hundred. Based on the development of the GNFP method and its subsequent results, conclusions can be made.

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号