A new min-cut problem with application to electric power network partitioning

European Transactions on Electrical Power

Volumn 19, Issue 6, 2009, Pages 778-797

  Sen, Arunabha ^a   Ghosh, Pavel ^a   Vittal, Vijay ^a   Yang, Bo ^b  

^a Arizona State University   (United States)

^b PACIFIC NORTHWEST NATIONAL LABORATORY   (United States)

Author keywords

Computational complexity; Electrical power network; Graph partitioning; Heuristic algorithm; Integer linear programming; Islanding

Indexed keywords

CASCADING FAILURES; COMPUTATION PROBLEMS; DIFFERENT DOMAINS; DIRECTED GRAPHS; EDGE WEIGHTS; ELECTRIC POWER; ELECTRIC POWER NETWORKS; ELECTRICAL POWER; ELECTRICAL POWER NETWORK; GRAPH PARTITION PROBLEM; GRAPH PARTITIONING; GRAPH PARTITIONING PROBLEMS; HEURISTIC SOLUTIONS; INTEGER LINEAR PROGRAMMING; ISLANDING; MIN-CUT; MINIMUM CUT; NP COMPLETE; OPTIMAL SOLUTIONS; POLYNOMIAL-TIME; SUBGRAPHS;

COMPUTATIONAL COMPLEXITY; DISTRIBUTED PARAMETER NETWORKS; DYNAMIC PROGRAMMING; ELECTRIC NETWORK ANALYSIS; ELECTRIC POWER DISTRIBUTION; ELECTRIC POWER MEASUREMENT; ELECTRIC POWER SUPPLIES TO APPARATUS; ELECTRIC POWER TRANSMISSION; ELECTRIC POWER TRANSMISSION NETWORKS; ELECTRICITY; GRAPH THEORY; HEURISTIC METHODS; INTEGER PROGRAMMING; LINEARIZATION; OPTIMAL SYSTEMS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; PORTALS; REACTIVE POWER;

HEURISTIC ALGORITHMS;

EID: 69949108613     PISSN: 1430144X     EISSN: 15463109     Source Type: Journal    
DOI: 10.1002/etep.255     Document Type: Article

References (29)

1. Tiptipakorn S. A spectral bisection partitioning method for electric power network applications. Ph.D. Dissertation, Department of Electrical and Computer Engineering, University of Wisconsin, 2001. Also available as PSERC 2001 Publication 01-29.
2. Wang X. Slow coherency grouping based islanding using minimal cutsets and generator coherency index tracing using the continuation method. Ph.D. Dissertation, Department of Electrical Engineering, Iowa State University, 2005.
3. Alpert CJ, Kahng AB. Recent directions in netlist partitioning: a survey. INTEGRATION (the VLSI Journal) 19:1-81.
4. Alpert CJ, Kahng AB. Multi-way partitioning via spacefilling curves and dynamic programming. Proceedings of 31st ACM IEEE Design Automation Conference, San Diego, 1994:652-657.
5. Andreatta AA, Ribeiro CC. A graph partitioning heuristic for the parallel pseudo-exhaustive logical test of VLSI combinatorial circuits. Annals of Operations Research Journal 1994; 50(1):1-36.
6. Ball CF, Kraus PV, Mlynski DA. Fuzzy partitioning applied to VLSI-partitioning and placement. 1994 IEEE International Symposium on Circuits and Systems, ISCAS'94, Vol.1, 30 May-2 Jun 1994; 177-180.
7. Wei YC, Cheng CK. Ratio-cut partitioning for hierarchical designs. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 1991; 10(7):911-921.
8. Barnes ER. An algorithm for partitioning the nodes of a graph, 20th IEEE Conference on Decision and Control Including the Symposium on Adaptive Processes, Vol.20, December 1981; 303-304.
9. Chlebikova J. Approximating the maximally balanced connected partition problem in graphs. Information Processing Letters 1996; 60:225-230.
10. Awerbuch B, Leighton FT. Multicommodity flows: a survey of recent research. Lecture Notes in Computer Science, Vol.762, Proceedings of the 4th International Symposium on Algorithms and Computation, 1993:297-302.
11. Leighton T, Rao S. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM 1999; 46(6):787-832.
12. Amir E, Krauthgamer R, Rao S. Constant factor approximation of vertex-cuts in planar graphs, STOC'03, San Diego, June 9-11, 2003.
13. Khandekar R, Rao S, Vazirani U. Graph partitioning using single commodity flows. STOC'06, Seattle, May 21-23, 2006.
14. Shi J, Malik J. Normalized cuts and image processing. IEEE Transactions on Pattern Analysis and Machine Intelligence 2000; 22(8).
15. Tsai MS. Development of islanding early warning mechanism for power systems. IEEE Power Engineering Society Summer Meeting 2000; 1:22-26.
16. Wang X, Vittal V. System islanding using minimal cutsets with minimum net flow. Proceedings of 2004 IEEE PES Power System Conference and Exposition, New York, 2004.
17. Yang B, Vittal V, Heydt GT, Sen A. A novel slow coherency based graph theoretic islanding strategy. IEEE Power Engineering Society General Meeting 2007; 1-7.
18. You H, Vittal V, Yang Z. Self-healing in power systems: An approach using islanding and rate frequency decline based load shedding. IEEE Transactions on Power Systems 2003; 18(1):174-181.
19. You H, Vittal V, Wang X. Slow coherency based islanding. IEEE Transactions on Power Systems 2004; 19(1):483-491.
20. Even S. Graph Algorithms. Computer Science Press: Washington, DC, 1979.
21. Ahuja RK, Magnanti TL, Orlin JB. Network Flows. Prentice-Hall: Englewood Cliffs, NJ, 1993.
22. Cormen TH, Leiserson CE, Rivest RL, Stein C. Introduction to Algorithms. McGraw-Hill: New York, NY, 2001.
23. Kleinberg J, Tardos E. Algorithm Design. Pearson, Addison Wesley: Boston, MA, 2005.
24. van Emde Boas P. Another NP-complete partition problem and the complexity of computing short vectors in a lattice. Report MI-UvA-81-104, University of Amsterdam; http://staff.science.uva.nl/~peter
25. Klein P., Ravi R. A nearly best-possible approximation algorithm for node-weighted Steiner trees. Journal of Algorithms 1995:19 104-105.
26. Klein P, Ravi R. A nearly best-possible approximation algorithm for node-weighted Steiner trees. Journal of Algorithms 1995; 19:104-115. Preliminary version appeared in Proceedings ofthe 3rd Symposium on Integer Programming and Combinatorial Optimization, 1993:323-332.
27. Random Graph Generation: www.liafa.jussieu.fr/~fabien/generation
28. Graph Drawing Software: www.graphviz.org
29. Garey MR, Johnson DS. Computers and Intractability: An Introduction to the Theory of NP-Completeness. W.H. Freeman: New York, NY, 1979.