Informs Annual Meeting 2017

SB79

INFORMS Houston – 2017

SB79

Generation expansion planning models determine capacity investment decisions that minimize market costs. Such models are often dominated with fossil fuel investments. While they are economical sources of electricity, fossil fuels create by-products that have harmful health effects. To mitigate this, we leverage an EPA screening tool along with simulation methods to create a closed-form relationship between expansion decisions and health damages to be included in the objective function of the expansion planning model. This yields minimized societal costs and health damages from emissions in the electricity sector. 2 - Microgrid Formation Approach for Resilient Electricity Networks Alberto J. Lamadrid, Lehigh University, 621 Taylor Street, R451, Bethlehem, PA, 18015-3120, United States, ajl259@cornell.edu We propose a program for microgrid formation in the electricity system after a disruption, considering a system with high penetration of renewables and where flows are expected to be undirected. We compare our extended formulation to results presented in the literature. Additionally, we allow for possible mobile and fixed Distributed Generation technologies, Distributed Energy Resources, and demand responsive loads with a minimum satisfiability constraint. The extended mixed-integer linear program (MILP) can be used as an operations and a short term planning tool for DG scenario-based location. The MILP is applied to the IEEE 37-bus, 30-bus and 118-bus systems. 3 - Designing Hydro Supply Chains for Energy Food and Flood Kwon Gi Mun, Fairleigh Dickinson University, Fort Lee, NJ, United States, kgmun@fdu.edu, Yao Zhao, Razi Ali Rafique In this research, we apply SCM concepts to water resource development and provide the end-to-end and dynamic perspectives. We found that the development of hydropower has the potential to address all these issues such as water, food, and energy. Our results demonstrate the value of the supply chain perspective on hydro network expansion, and provide insights on the optimal development strategies regarding location, sequence and mix of hydro projects. 382A Joint Session OPT/Practice: Applications of Stochastic and Robust Optimization Sponsored: Optimization, Optimization Under Uncertainty Sponsored Session Chair: Sebastian Maier, Imperial College London, Imperial College Road, Skempton Building, London, SW7 2AZ, United Kingdom, s.maier13@imperial.ac.uk 1 - Valuing Portfolios of Real Options under Both Exogenous and Endogenous Uncertainties Sebastian Maier, Imperial College London, Imperial College Road, Skempton Building, London, SW7 2AZ, United Kingdom, s.maier13@imperial.ac.uk, Georg Pflug, David Gann, John Polak We extend our existing approach for modeling and approximating the value of portfolios of real options to include endogenous, decision- and state-dependent uncertainties. The options are to defer investment, to stage investment, to temporarily halt expansion, to temporarily mothball the operation, and to abandon the project. Two of the underlying uncertainties, decision-dependent cost to completion and state-dependent salvage value, are endogenous, the other two, annual operating revenues and their growth rate, are exogenous. Using a simulation and regression approach we present an efficient valuation algorithm. Its applicability is illustrated by valuing an infrastructure investment. 2 - Integrating Decisions with Advance Supply Information in Assemble-to-order Systems Jie Chu, McMaster University, 1280 Main St, W. Hamilton, ON, L8S.4M4, Canada, chuj6@mcmaster.ca, Kai Huang In this paper, we consider a periodic review Assemble-To-Order (ATO) system, where each component follows an independent base stock policy. We first consider the ATO system with lead time and demand uncertainties in which the decision maker has advanced knowledge of uncertain lead times. Then we advance the methodology by considering a situation where the decision maker only has full distributional knowledge of uncertain lead times. The stochastic programming models are proposed and solved by the sample-average- approximation (SAA) algorithm. SB81

381B Recent Advances in AC Optimal Power Flow Sponsored: Energy, Natural Res & the Environment Electricity Sponsored Session Chair: Andy Sun, Georgia Institute of Technology, Atlanta, GA, 30312, United States, andy.sun@isye.gatech.edu 1 - Optimal Power Flow of Radial Networks and its Variations: A Sequential Convex Optimization Approach Na Li, Harvard University, 33 Oxford St, Cambridge, MA, 02138, United States, nali@seas.harvard.edu, Wei Wei, Jianhui Wang, Shengwei Mei A sequential convex optimization method is proposed to solve broader classes of optimal power flow (OPF) problems over radial networks. The non-convex branch power flow equation is decomposed as a second-order cone inequality and a non-convex constraint involving the difference of two convex functions. This approach solves a sequence of convexified penalization problems, where concave terms are approximated by linear functions and updated in each iteration. It could recover a feasible power flow solution, which usually appears to be very close, if not equal, to the global optimal one. Two variations of the OPF problem whose convex relaxation is generally inexact, are elaborated in detail. 2 - Characterizing Non-convexities in the Feasible Spaces of AC OPF Problems Daniel K.Molzahn, Argonne National Laboratory, 1111 S. Wabash Ave., Apt 1507, Chicago, IL, 60605, United States, dan.molzahn@gmail.com Optimal power flow (OPF) is one of the key power system optimization problems. OPF problems that use an AC power flow model can have non-convex feasible spaces. As part of an effort to characterize the difficulty associated with solving different AC OPF problems, this presentation discusses approaches for identifying non-convexities in AC OPF feasible spaces. These approaches include a method for computing the entire feasible space for small AC OPF problems and an algorithm for identifying pairs of points which certify the existence of a non- convex region of the feasible space. 3 - Some Techniques for Strengthening the SOCP Relaxations for Solving AC OPF Andy Sun, Georgia Institute of Technology, 755 Ferst Drive, Atlanta, GA, 30312, United States, andy.sun@isye.gatech.edu In this talk, we will discuss some techniques to strengthen the SOCP relaxations of ACOPF both single-phase and multi-phase, including minor reformulation of rank one constraints, bound tightening, and some linear transformation techniques. 4 - Convex Relaxation of Optimal Power Flow in Multiphase Radial Networks with Delta Connections Changhong Zhao, National Renewable Energy Laboratory, 15013 Denver West Pkwy, Golden, CO, 80401, United States, changhong.zhao@nrel.gov, Emiliano Dall’Anese, Steven Low We proposes a semidefinite relaxation of the AC optimal power flow (OPF) problem in multiphase radial networks with wye and delta connections. Two multiphase power flow models are developed to facilitate the integration of delta- connected loads or generation resources in the OPF problem. The first model is called the extended branch flow model. The second model leverages a linear relationship between phase-to-ground power injections and delta connections under a balanced voltage approximation. Based on these models, pertinent OPF problems are formulated and relaxed to semidefinite programs. Numerical studies on IEEE test feeders show efficiency and exactness of the proposed relaxations. 381C Designing Energy and Water Supply Chains for Prosperity Sponsored: Energy, Natural Res & the Environment, Energy Sponsored Session Chair: Yao Zhao, Rutgers University, Newark, NJ, 07102-1895, United States, yaozhao@andromeda.rutgers.edu Co-Chair: Kwon Gi Mun, Fairleigh Dickinson University, 2050, Fort Lee, NJ, 07024, United States, kgmun@fdu.edu 1 - Simulation-based Optimization Models for Electricity Generation Expansion Planning Problems Considering Human Health Externalities Mark Rodgers, PhD, Rutgers University, Newark, NJ, United States, markrodgersphd@gmail.com SB80

64

Made with FlippingBook flipbook maker