A heuristic method for reactive power planning
- 1 February 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 11 (1), 68-74
- https://doi.org/10.1109/59.485987
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
This publication has 14 references indexed in Scilit:
- Application of decomposition techniques to VAr planning: methodological and computational aspectsIEEE Transactions on Power Systems, 1994
- Multi-year multi-case optimal VAR planningIEEE Transactions on Power Systems, 1990
- Branch-and-bound and parallel computation: A historical noteOperations Research Letters, 1988
- A simulation tool for the performance evaluation of parallel branch and bound algorithmsMathematical Programming, 1988
- A parallel integer linear programming algorithmEuropean Journal of Operational Research, 1988
- Experiments with parallel algorithms for combinatorial problemsEuropean Journal of Operational Research, 1988
- A New Optimization Method for Large Scale Fixed Charge Transportation ProblemsOperations Research, 1981
- Pivot and Complement–A Heuristic for 0-1 ProgrammingManagement Science, 1980
- Integer Programming Algorithms: A Framework and State-of-the-Art SurveyManagement Science, 1972
- An approximate solution method for the fixed charge problemNaval Research Logistics Quarterly, 1967