A heuristic method for reactive power planning

Journal Article · Thu Feb 01 00:00:00 EST 1996 · IEEE Transactions on Power Systems

DOI:https://doi.org/10.1109/59.485987· OSTI ID:244730

Mantovani, J R.S. ^[1]; Garcia, A V ^[2]

---

1. DEE/FEIS/UNESP, Ilha Solteira, Sao Paulo (Brazil)
2. DSEE/FEE/UNICAMP, Campinas, Sao Paulo (Brazil)

An approach for solving reactive power planning problems is presented, which is based on binary search techniques and the use of a special heuristic to obtain a discrete solution. Two versions were developed, one to run on conventional (sequential) computers and the other to run on a distributed memory (hypercube) machine. This latter parallel processing version employs an asynchronous programming model. Once the set of candidate bases has been defined, the program gives the location and size of the reactive sources needed (if any) in keeping with operating and security constraints.

• OSTI ID: 244730
• Report Number(s): CONF-950103-; ISSN 0885-8950; TRN: IM9627%%52
• Journal Information: IEEE Transactions on Power Systems, Vol. 11, Issue 1; Conference: Winter meeting of the IEEE Power Engineering Society, New York, NY (United States), 29 Jan - 2 Feb 1995; Other Information: PBD: Feb 1996
• Country of Publication: United States
• Language: English

Related Subjects

24 POWER TRANSMISSION AND DISTRIBUTION
POWER DISTRIBUTION SYSTEMS
POWER FACTOR
PLANNING
HYPERCUBE COMPUTERS
PARALLEL PROCESSING