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

The problem of partitioning a graph into two or more subgraphs that satisfies certain conditions is encountered in many different domains. Accordingly, graph partitioning problem has been studied extensively in the last 50 years. The most celebrated result among this class of problems is the max flow = min cut theorem due to Ford and Fulkerson. Utilizing the modifications suggested by Edmonds and Karp, it is well known that the minimum capacity cut in the directed graph with edge weights can be computed in polynomial time. If the partition divides the node set V into subsets V1 and V2, where V1 contains one of the specified nodes s and V2 contains the other specified node t, the capacity of a cut is defined as the sum of the edge weights going from V1 to V2. In electrical power distribution networks, a slow-coherency-based islanding strategy is used as a prevention against the cascading failures. In this paper, we concentrate on the graph partition problems which are encountered in electric power distribution networks. In this environment, two different definitions of capacity of a cut are used. In the first definition, capacity of a cut is taken to be the difference of the edge weights going from V1 to V2 and from V2 to V1. In the second definition, the capacity of a cut is taken to be the maximum of sum of the edge weights going from V1 to V2 and from V2 to V1. Surprisingly, with slight change of the definition of the capacity of a cut, the computational complexity of the problem changes significantly. In this paper, we show that with the new definitions of the capacity of a cut, the minimum cut computation problem becomes NP-complete. We provide an optimal solution to the problems using mathematical programming techniques. In addition, we also provide heuristic solutions and compare the performance with that of the optimal solution. Copyright © 2008 John Wiley & Sons, Ltd.

[1]  R. Khandekar,et al.  Graph partitioning using single commodity flows , 2006, STOC 2006.

[2]  Shimon Even,et al.  Graph Algorithms , 1979 .

[3]  Éva Tardos,et al.  Algorithm design , 2005 .

[4]  C. Alpert,et al.  Multi-Way Partitioning Via Spacefilling Curves and Dynamic Programming , 1994, 31st Design Automation Conference.

[5]  R. Ravi,et al.  A nearly best-possible approximation algorithm for node-weighted Steiner trees , 1993, IPCO.

[6]  Carsten F. Ball,et al.  Fuzzy partitioning applied to VLSI-floorplanning and placement , 1994, Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94.

[7]  Michael Jünger,et al.  Graph Drawing Software , 2003, Graph Drawing Software.

[8]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[9]  Vijay Vittal,et al.  Self-healing in power systems: an approach using islanding and rate of frequency decline-based load shedding , 2002 .

[10]  G.T. Heydt,et al.  A Novel Slow Coherency Based Graph Theoretic Islanding Strategy , 2007, 2007 IEEE Power Engineering Society General Meeting.

[11]  Frank Thomson Leighton,et al.  Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.

[12]  Andrew B. Kahng,et al.  Recent directions in netlist partitioning: a survey , 1995, Integr..

[13]  Xiaoming Wang,et al.  Slow coherency grouping based islanding using minimal cutsets and generator coherency index tracing using the continuation method , 2005 .

[14]  Baruch Awerbuch,et al.  Multicommodity Flows: A Survey of Recent Research , 1993, ISAAC.

[15]  Earl R. Barnes.  An algorithm for partitioning the nodes of a graph , 1981, CDC 1981.

[16]  Chung-Kuan Cheng,et al.  Ratio cut partitioning for hierarchical designs , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[17]  Robert Krauthgamer,et al.  Constant factor approximation of vertex-cuts in planar graphs , 2003, STOC '03.

[18]  Men-Shen Tsai.  Development of islanding early warning mechanism for power systems , 2000, 2000 Power Engineering Society Summer Meeting (Cat. No.00CH37134).

[19]  Janka Chlebíková,et al.  Approximating the Maximally Balanced Connected Partition Problem in Graphs , 1996, Inf. Process. Lett..

[20]  Celso C. Ribeiro,et al.  A graph partitioning heuristic for the parallel pseudo-exhaustive logical test of VLSI combinational circuits , 1994, Ann. Oper. Res..

[21]  V. Vittal,et al.  Slow coherency-based islanding , 2004, IEEE Transactions on Power Systems.

[22]  V. Vittal,et al.  System islanding using minimal cutsets with minimum net flow , 2004, IEEE PES Power Systems Conference and Exposition, 2004..