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

Abstract

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 01, 1986
Accession Number
ADA166843

Entities

People

  • Roy E. Rice

Organizations

  • Air Force Institute of Technology

Tags

DTIC Thesaurus Topics

  • Accuracy
  • Air Force
  • Algorithms
  • Computer Programming
  • Computer Programs
  • Computers
  • Demographic Cohorts
  • Electrical Engineering
  • Energy Systems
  • Equations
  • Flow Network
  • Generators
  • Iterations
  • Literature Surveys
  • Notation
  • Optimization
  • Security

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Aviation Safety and Air Traffic Management
  • Database Systems and Applications