A heuristic method for reactive power planning

Author

Mantovani, J.R.S. ; Garcia, A.V.

Author_Institution

UNESP, Ilha Solteira, Brazil

Volume

11

Issue

1

fYear

1996

fDate

2/1/1996 12:00:00 AM

Firstpage

68

Lastpage

74

Abstract

An approach for solving power system 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 buses has been defined, the program gives the location and size of the reactive sources needed (if any) in keeping with operating and security constraints

Keywords

heuristic programming; hypercube networks; parallel processing; power system CAD; power system analysis computing; power system planning; power system security; reactive power; search problems; CAD; asynchronous programming model; computer simulation; discrete solution; distributed memory machines; heuristic method; hypercube; operating constraints; parallel processing; power systems; reactive power planning; reactive source location; reactive source size; security constraints; sequential computers; Costs; Distributed computing; Hypercubes; Investments; Linear programming; Meeting planning; Parallel processing; Power system planning; Reactive power; System testing;

fLanguage

English

Journal_Title

Power Systems, IEEE Transactions on

Publisher

ieee

ISSN

0885-8950

Type

jour

DOI

10.1109/59.485987

Filename

485987