Abstract
The Incorporation of deregulation and increase in renewable sources of generation has shifted the nature of existing power systems to a more geographically distributed system. This had led to significant challenges towards on-line monitoring and control. Contingency set identification is an essential step in monitoring the power system security level. Multiple contingency analysis forms the basis of security issues, particularly of large, interconnected power systems. The difficulty of multiple contingency selections for on-line security analysis lies in its inherent combinatorial nature. In this paper, an approach for identification of power system vulnerability to avoid catastrophic failures is put forward, as a multi objective optimization problem that partitions its topology graph, accounts for maximizing the imbalance between generation and load in each island and at the same time minimizes the number of lines cut to realize the partitions. The Nondominated Sorted Genetic Algorithm, version II (NSGA II) has been applied to obtain the optimal solutions and the methodology involved has been applied to an IEEE 30 bus test system and results are presented.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Jian, P., McCalley, J.: On-line analysis of high-order contingencies. In: Proc. North Amer. Power Symp., pp. 297–302 (2001)
Ekwue, A.O.: A Review of Automatic Contingency Selection Algorithms for Online Security Analysis. In: The Third International Conference on Power System Monitoring and Control, pp. 152–155 (1991)
Phadke, A.G., Thorp, J.S.: Expose Hidden Failures to Prevent Cascading Outages in Power Systems. IEEE Comput. Appl. Power 9(3), 20–23 (1996)
Sen, A., Ghosh, P., Vittal, V., Yang, B.: A New Min-Cut Problem with Application to Electric Power Network Partitioning. European Transactions on Electrical Power 19(6), 778–797 (2009)
Donde, V., López, V., Lesieutre, B.C., Pinar, A., Yang, C., Meza, J.: Identification of severe multiple contingencies in electric power networks. In: Proceedings of the North American Power Symposium (2005)
Lesieutre, B.C., Roy, S., Donde, V., Pinar, A.: Power System Extreme Event Screening using Graph Partitioning. In: IEEE 38th North American Power Symposium, pp. 503–510 (2006)
Osyczka, A.: Multicriteria optimization for engineering design. In: Gero, J.S. (ed.) Design Optimization, pp. 193–227. Academic Press, New York (1985)
Deb, K.: Multi Objective Optimization Using Evolutionary Algorithms. Wiley, New York (2001)
Deb, K., Pratap, A., Agarwal, Meyarivan, S.: A fast and elitist multi-objective genetic algorithm:NSGA-II. IEEE Transactions on Evolutionary Computation 6(2), 181–197 (2002)
Power System Test Case Archive, http://www.ee.washington.edu/research/pstca/pf30/pg_tca30bus.html (last accessed on July 28, 2011)
Qu, B.Y., Suganthan, P.N.: Multi-Objective Evolutionary Algorithms based on the Summation of Normalized Objectives and Diversified Selection. Information Sciences 180(17), 3170–3181 (2010)
Zhou, A., Qu, B.-Y., Li, H., Zhao, S.-Z., Suganthan, P.N., Zhang, Q.: Multiobjective Evolutionary Algorithms: A Survey of the State-of-the-art. Swarm and Evolutionary Computation 1(1), 32–49 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rao, N.M., Roy, D.S., Mohanta, D.K. (2011). Application of NSGA - II to Power System Topology Based Multiple Contingency Scrutiny for Risk Analysis. In: Panigrahi, B.K., Suganthan, P.N., Das, S., Satapathy, S.C. (eds) Swarm, Evolutionary, and Memetic Computing. SEMCCO 2011. Lecture Notes in Computer Science, vol 7076. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27172-4_83
Download citation
DOI: https://doi.org/10.1007/978-3-642-27172-4_83
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27171-7
Online ISBN: 978-3-642-27172-4
eBook Packages: Computer ScienceComputer Science (R0)