Power Grid Visualization by Means of Optimization

The operations in electric power control centers play a crucial role in ensuring the integrity of the nation’s electric grid and present formidable challenges to human operators. One of the primary challenges of information display for a power transmission control room application is the clutter from displaying too much information in too small of a display space. Thus, the task to optimize the layout of visual elements consisting of substations and transmission lines on the display interface is of vital importance. To this end, algorithms using several optimization techniques including Lagrangian relaxation and progressive hedging are proposed in this paper to make the interface less cluttered subject to human perceptual and cognitive capabilities. We conduct extensive computational studies to evaluate and compare the developed algorithms, and report our findings based on a real-world power grid in the U.S.

[1]  Thomas Lengauer,et al.  The efficient solution of integer programs for hierarchical global routing , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  Changzheng Liu,et al.  Solving Stochastic Transportation Network Protection Problems Using the Progressive Hedging-based Method , 2010 .

[3]  Michael Burstein,et al.  Hierarchical Wire Routing , 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[4]  Chung-Kuan Cheng,et al.  A global router with a theoretical bound on the optimal solution , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  Shuji Tsukiyama,et al.  A hybrid hierarchical approach for multi-layer global routing , 1995, Proceedings the European Design and Test Conference. ED&TC 1995.

[6]  Prabhakar Raghavan,et al.  Multiterminal global routing: A deterministic approximation scheme , 2005, Algorithmica.

[7]  Hu Zhang,et al.  Global Routing in VLSI Design: Algorithms, Theory, and Computational Practice , 2010 .

[8]  Dana S. Richards,et al.  Complexity of Single-Layer Routing , 1984, IEEE Transactions on Computers.

[9]  Chak-Kuen Wong,et al.  A weighted Steiner tree-based global router with simultaneous length and density minimization , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10]  David L. Woodruff,et al.  Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems , 2011, Comput. Manag. Sci..

[11]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[12]  Man-Tak Shing,et al.  A decomposition algorithm for circuit routing , 1985 .

[13]  Chak-Kuen Wong,et al.  Global routing based on Steiner min-max trees , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[14]  Christoph Albrecht,et al.  Provably good global routing by a new approximation algorithm for multicommodity flow , 2000, ISPD '00.

[15]  Rommert Dekker,et al.  A Scenario Aggregation - Based Approach for Determining a Robust Airline Fleet Composition for Dynamic Capacity Allocation , 2002, Transp. Sci..

[16]  Sachin S. Sapatnekar,et al.  A survey on multi-net global routing for integrated circuits , 2001, Integr..

[17]  R. Tyrrell Rockafellar,et al.  Scenarios and Policy Aggregation in Optimization Under Uncertainty , 1991, Math. Oper. Res..

[18]  Ulrik Brandes,et al.  Orthogonal-Ordering Constraints are Tough , 2013, J. Graph Algorithms Appl..

[19]  Eugene Shragowitz,et al.  A global router based on a multicommodity flow model , 1987, Integr..

[20]  F. Leighton,et al.  Drawing graphs in the plane with high resolution , 1993 .

[21]  Klaus Winter,et al.  Hierarchical Loose Routing for Gate Arrays , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[22]  Luther C. Abel.  On the Ordering of Connections for Automatic Wire Routing , 1972, IEEE Transactions on Computers.

[23]  Norman L. Soong,et al.  Hierarchical VLSI Routing--An Approximate Routing Procedure , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[24]  Chak-Kuen Wong,et al.  A Hierarchical Global Wiring Algorithm for Custom Chip Design , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[25]  Anthony Vannelli,et al.  On routing in VLSI design and communication networks , 2005, Discret. Appl. Math..

[26]  Marshall L. Fisher,et al.  The Lagrangian Relaxation Method for Solving Integer Programming Problems , 2004, Manag. Sci..