Article

A Majorization-Minimization Approach to Design of Power Transmission Networks

04/2010; DOI: 10.1109/CDC.2010.5717226
Source: arXiv

ABSTRACT 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)

0 Followers
 · 
125 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: Vehicle-to-Grid (V2G) technology utilizes the stored energy in electric vehicle batteries to contribute electricity back to the grid. The energy in batteries can move with electric vehicles (EVs). Combining V2G and the mobility of vehicles, EVs can provide a natural energy transmission architecture called mobile electrical grid. The main idea of this paper focuses on multiple energy transmission route in mobile electrical grid from solar energy sources to places as capacity of every energy route is limited. The features of energy route in mobile electrical grid are analyzed and a minimum cost flow algorithm is presented. Simulations using real-world transporting data in Manhattan. Simulations show that this method is efficient.
    2014 IEEE Power & Energy Society Innovative Smart Grid Technologies Conference (ISGT); 02/2014
  • [Show abstract] [Hide abstract]
    ABSTRACT: We explore optimization methods for planning the placement, sizing and operations of flexible alternating current transmission system (FACTS) devices installed to relieve transmission grid congestion. We limit our selection of FACTS devices to series compensation (SC) devices that can be represented by modification of the inductance of transmission lines. Our master optimization problem minimizes the l1 norm of the inductance modification subject to the usual line thermal-limit constraints. We develop heuristics that reduce this non-convex optimization to a succession of linear programs (LP) that are accelerated further using cutting plane methods. The algorithm solves an instance of the MatPower Polish Grid model (3299 lines and 2746 nodes) in 40 seconds per iteration on a standard laptop—a speed that allows the sizing and placement of a family of SC devices to correct a large set of anticipated congestions. We observe that our algorithm finds feasible solutions that are always sparse, i.e., SC devices are placed on only a few lines. In a companion manuscript, we demonstrate our approach on realistically sized networks that suffer congestion from a range of causes, including generator retirement. In this manuscript, we focus on the development of our approach, investigate its structure on a small test system subject to congestion from uniform load growth, and demonstrate computational efficiency on a realistically sized network.
    New Journal of Physics 10/2014; 16(10):105015. DOI:10.1088/1367-2630/16/10/105015 · 3.67 Impact Factor
  • [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.

Preview

Download
1 Download
Available from