원문정보
초록
영어
In power systems operation, state estimation takes an important role in security control. For the state estimation problem, the weighted least squares (WLS) method and the fast decoupled method have been widely used at present. Especially when bad data are mutually interacting, the detecting of multiple bad data may be difficult to handle, since the normalized or weighted residuals may become faulty. Then the problem of detecting bad data is considered as a combinatorial decision procedure. In this paper, the binary Particle Swarm Optimization (PSO) is used for the detecting of multiple bad data in the power system state estimation. The PSO, like other meta-heuristic algorithms, can handle constrains that would be troublesome in classical mathematical approach. However, population based algorithms require higher computing time to find optimal point. This shortcoming is overcome by a parallel processing of PSO algorithm. The parallel PSO algorithm is implemented on a PC cluster system with 8 personal computers. The proposed approach has been tested on the IEEE-14 and 118 bus systems. The results showed that the binary PSO based procedures behave satisfactorily in the detecting multiple bad data and computing time of parallelized PSO algorithm can be reduced without losing the quality of solution.
목차
1. Introduction
2. Formulation of the Problem
3. Particle Swarm Optimization
3.1. Overview of Particle Swarm Optimization
3.2. Binary PSO
3.3. Handling Problem Constraints
4. Implementation Issues
4.1. Parallel PSO Algorithm
4.2. PC Cluster Systems
4.3. Reducing the Search Space
5. Case studies
5.1. Single Processor
5.2. 8-Processor PC Cluster System
6. Conclusion
Acknowledgements
References