Power system extreme event screening using graph partitioning

2006 38th Annual North American Power Symposium, NAPS-2006 Proceedings

Volumn , Issue , 2006, Pages 503-510

  Lesieutre, Bernard C ^a   Roy, Sandip ^b   Donde, Vaibhav ^a   Pinar, Ali ^a  

^a LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

^b WASHINGTON STATE UNIVERSITY   (United States)

Author keywords

Extreme events; Graph partitioning

Indexed keywords

APPROXIMATE SOLUTIONS; ELECTRIC POWERS; EXTREME EVENTS; GRAPH PARTITIONING; PARTITIONING PROBLEMS; POWER IMBALANCES; POWER SYSTEMS; STOCHASTIC METHODS;

ELECTRIC GENERATORS; ELECTRIC POWER TRANSMISSION NETWORKS; POWER TRANSMISSION;

ELECTRIC POWER SYSTEMS;

EID: 48449100005     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/NAPS.2006.359618     Document Type: Conference Paper

References (18)

1. Western Electricity Coordinating Council, Operating Committee Handbook, p. III-119, revised 2005.
2. V. Donde, V. López, B.C. Lesieutre, A. Pinar, C. Yang, and J. Meza, "Identification of severe multiple contingencies in electric power networks," in Proceedings of the North American Power Symposium, Ames, IA, October 2005.
3. V. Donde, V. López, B.C. Lesieutre, A. Pinar, C. Yang, and J. Meza, "Identification of Severe Multiple Contingencies in Electric Power Systems," submitted to the IEEE Transactions on Power Systems.
4. M. Fiedler, "A property of eigenvectors of nonnegative symmetric matrices and its applications to graph theory," Czechoslovak Mathematical Journal, 25(100), pp.619-633, 1975.
5. M. Stoer and F. Wagner, "A Simple Min-Cut Algorithm," Journal of the ACM, Vol. 44, No. 4, July 1997, pp. 585-591.
6. B.L. Chamberlain, "Graph partitioning algorithms for distributed workloads of parallel computations," Tech Report TR-98-10-03, University of Washington, Dept. of Computer Science and Engineering, October 1998. http://www.cs.washington.edu/homes/brad/cv/pubs/degree/generals.pdf
7. Power System Test Case Archive, http//:www.ee.washington.edu/research/ pstca
8. D. Karger, "Randomization in Graph Optimization Problems: A Survy," Optima, No 58, June, 1998.
9. C. Asavathiratham, S. Roy, B.C. Lesieutre, and G.C. Verghese, "The Influence Model," IEEE Control Systems Magazine, pp. 52-64, December 2001.
10. A. Pothen, H. Simon, and K.-P. Liou, "Partitioning sparse matrices with eigenvectors of graphs," SIAM Journal on Matrix Analysis and Applications, 11(3): 430-452, 1990.
11. A. Pothen, E. Rothberg, H. Simon, and L.Wang, "Parallel sparse Cholesky factorization with spectral nested bisection ordering," Technical Report RNR-94-011, Numerical Aerospace Simulation Facility, NASA Ames Research Center, May 1994.
12. F. Pellegrini, "SCOTCH 4.0 User's guide," Research report Laboratoire Bordelais de Recherche en Informatique, 2006.
13. C. Walshaw, M. Cross, and K. McManus, "Multiphase Mesh Partitioning. Appl. Math. Modelling," 25(2):123-140, 2000.
14. Bruce Hendrickson and Robert Leland, "The Chaco User's Guide: Version 2.0," Sandia Tech Report SAND94-2692, 1994.
15. George Karypis and Vipin Kumar, "A fast and high quality multilevel scheme for partitioning irregular graphs," International Conference on Parallel Processing, pp. 113-122, 1995.
16. R. Preis and R. Diekmann, "The PARTY Partitioning-Library, User Guide - Version 1.1," Technical Report tr-rsfb-96-024, University of Paderborn, Sep. 1996.
17. C. J. Alpert and S. Z. Yao, "Spectral Partitioning, the More Eigenvectors the Better," 32nd ACM/IEEE Design Automation Conference, San Francisco, June 1995, pp. 195-200.
18. D.A. Spielman and S.H. Teng, "Spectral Partitioning Works: Planar graphs and finite element meshes," Proc. IEEE Symposium on Foundations of Computer Science, pp. 96-105, 1996.