A Majorization-Minimization Approach to Design of Power Transmission Networks

Proceedings of the IEEE Conference on Decision and Control 04/2010; DOI: 10.1109/CDC.2010.5717226
Source: arXiv


We propose an optimization approach to design cost-effective electrical power transmission networks. That is, we aim to select both the network structure and the line conductances (line sizes) so as to optimize the trade-off between network efficiency (low power dissipation within the transmission network) and the cost to build the network. We begin with a convex optimization method based on the paper ``Minimizing Effective Resistance of a Graph'' [Ghosh, Boyd \& Saberi]. We show that this (DC) resistive network method can be adapted to the context of AC power flow. However, that does not address the combinatorial aspect of selecting network structure. We approach this problem as selecting a subgraph within an over-complete network, posed as minimizing the (convex) network power dissipation plus a non-convex cost on line conductances that encourages sparse networks where many line conductances are set to zero. We develop a heuristic approach to solve this non-convex optimization problem using: (1) a continuation method to interpolate from the smooth, convex problem to the (non-smooth, non-convex) combinatorial problem, (2) the majorization-minimization algorithm to perform the necessary intermediate smooth but non-convex optimization steps. Ultimately, this involves solving a sequence of convex optimization problems in which we iteratively reweight a linear cost on line conductances to fit the actual non-convex cost. Several examples are presented which suggest that the overall method is a good heuristic for network design. We also consider how to obtain sparse networks that are still robust against failures of lines and/or generators. Comment: 8 pages, 3 figures. To appear in Proc. 49th IEEE Conference on Decision and Control (CDC '10)

Full-text preview

Available from: ArXiv
  • Source
    • "cluding work on distribution networks [19], hierarchical networks [6] and other methods for assessing load and points of potential failure [33]. There are many such applications for these techniques including transport systems [14] and other utility distribution networks [36] but in this present paper we focus on electrical power distribution networks [1] [7] and associated graph issues [20] [24]. Many of the issues unique to electrical distribution networks arise because of their particular spatial structure and the topological constraints [17] with which they are built [28]. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Electrical power distribution networks are generally constructed incrementally over time and designs are heavily influenced by spatial geography. Assessing the robustness of electrical distribution networks against vulnerability to fragmentation and failure of particular nodes is a difficult general problem. Graph metrics such as betweenness and other centrality measures can give some indications of vulnerable nodes. We analyse both a parameterised synthetic power distribution network, and a real specific electrical network to experiment with: betweenness; centrality; clustering; and shortest-path distance metrics. We experiment with systematically removing the current most central node to study overall network degradation properties. We find that even for simple networks a great deal of inherent complexity exists and that the emergent failure properties are not necessarily monotonic and can exhibit sudden catastrophic changes.
  • Source
    • "It can be shown that in a DC-model approximation of a power grid, the average power dissipation of the grid is proportional to T r(AL + ), where A is a positive semi-definite matrix [8]. It is easy to verify that the power dissipation can be expressed as a linear combination of point-to-point resistance distances (similar to the case of network utilization). "
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper reconsiders the problem of robust network design form a different point of view using the concept of resistance distance from network science. It has been shown that some important network performance metrics, such as average utilization in a communication network or total power dissipation in an electrical grid, can be expressed in terms of linear combination of point-to-point resistance distances of a graph. In this paper we choose to have a weighted linear combination of resistance distances, referred to as weighted network criticality (WNC), as the objective and we investigate the vulnerability of different network types. In particular, We formulate a min-max convex optimization problem to design k-robust networks and we provide extension to account for joint optimization of resources and flows. We study the solution of the optimization problem in two different networks. First we consider RocketFuel topologies and Abilene as representatives for service provider networks, and we show gains that can be achieved by optimizing link capacities and flows in RocketFuel topologies and Abilene. In the second experience, we show the application of the proposed optimization problem in designing robust electrical grids.
    Computer Communications Workshops (INFOCOM WKSHPS), 2011 IEEE Conference on; 05/2011
  • [Show abstract] [Hide abstract]
    ABSTRACT: Complex networks need resilience to cascades - to prevent the failure of a single node from causing a far-reaching domino effect. Such resilience can be achieved actively or topologically. In active resilience schemes, sensors detect the cascade and trigger responses that protect the network against further damage. In topological resilience schemes, the network’s connectivity alone provides resilience by dissipating nascent cascades. Designing topologically resilient networks is a multi-objective discrete optimization problem, where the objectives include resisting cascades and efficiently performing a mission. Remarkably, terrorist networks and other “dark networks” have already discovered how to design such networks. While topological resilience is more robust than active resilience, it should not always be pursued because in some situations it requires excessive loss of network efficiency.
Show more