Large-scale unit commitment under uncertainty: an updated literature survey

The Unit Commitment problem in energy management aims at finding the optimal production schedule of a set of generation units, while meeting various system-wide constraints. It has always been a large-scale, non-convex, difficult problem, especially in view of the fact that, due to operational requirements, it has to be solved in an unreasonably small time for its size. Recently, growing renewable energy shares have strongly increased the level of uncertainty in the system, making the (ideal) Unit Commitment model a large-scale, non-convex and uncertain (stochastic, robust, chance-constrained) program. We provide a survey of the literature on methods for the Uncertain Unit Commitment problem, in all its variants. We start with a review of the main contributions on solution methods for the deterministic versions of the problem, focussing on those based on mathematical programming techniques that are more relevant for the uncertain versions of the problem. We then present and categorize the approaches to the latter, while providing entry points to the relevant literature on optimization under uncertainty. This is an updated version of the paper "Large-scale Unit Commitment under uncertainty: a literature survey" that appeared in 4OR 13(2), 115--171 (2015); this version has over 170 more citations, most of which appeared in the last three years, proving how fast the literature on uncertain Unit Commitment evolves, and therefore the interest in this subject

Water-related modelling in electric power systems: WATERFLEX Exploratory Research Project: version 1

Water is needed for energy. For instance, hydropower is the technology that generates more electricity worldwide after the fossil-fuelled power plants and its production depends on water availability and variability. Additionally, thermal power plants need water for cooling and thus generate electricity. On the other hand, energy is also needed for water. Given the increase of additional hydropower potential worldwide in the coming years, the high dependence of electricity generation with fossil-fuelled power plants, and the implications of the climate change, relevant international organisations have paid attention to the water-energy nexus (or more explicitly within a power system context, the water-power nexus). The Joint Research Centre of the European Commission, the United States Department of Energy, the Institute for Advanced Sustainability Studies, the Midwest Energy Research Consortium and the Water Council, or the Organisation for Economic Co-operation and Development, among others, have raised awareness about this nexus and its analysis as an integrated system. In order to properly analyse such linkages between the power and water sectors, there is a need for appropriate modelling frameworks and mathematical approaches. This report comprises the water-constrained models in electric power systems developed within the WATERFLEX Exploratory Research Project of the European Commission’s Joint Research Centre in order to analyse the water-power interactions. All these models are deemed modules of the Dispa-SET modelling tool. The version 1 of the medium-term hydrothermal coordination module is presented with some modelling extensions, namely the incorporation of transmission network constraints, water demands, and ecological flows. Another salient feature of this version of Dispa-SET is the modelling of the stochastic medium-term hydrothermal coordination problem. The stochastic problem is solved by using an efficient scenario-based decomposition technique, the so-called Progressive Hedging algorithm. This technique is an Augmented-Lagrangian-based decomposition method that decomposes the original problem into smaller subproblems per scenario. The Progressive Hedging algorithm has multiple advantages: — It is easy parallelizable due to its inherent structure. — It provides solution stability and better computational performance compared to Benders-like decomposition techniques (node-based decomposition). — It scales better for large-scale stochastic programming problems. — It has been widely used in the technical literature, thus demonstrating its efficiency. Its implementation has been carried out through the PySP software package which is part of the Coopr open-source Python repository for optimisation. This report also describes the cooling-related constraints included in the unit commitment and dispatch module of Dispa-SET. The cooling-related constraints encompass limitations on allowable maximum water withdrawals of thermal power plants and modelling of the power produced in terms of the river water temperature of the power plant inlet. Limitations on thermal releases or water withdrawals could be imposed due to physical or policy reasons. Finally, an offline and decoupled modelling framework is presented to link such modules with the rainfall-runoff hydrological LISFLOOD model. This modelling framework is able to accurately capture the water-power interactions. Some challenges and barriers to properly address the water-power nexus are also highlighted in the report.JRC.C.7-Knowledge for the Energy Unio

Short-term Hydro-thermal Coordination By Lagrangian Relaxation: A New Algorithm for the Solution of the Dual Problem

For decades, researchers have been studying the unit commitment problem in electrical power generation. To solve this complex, large scale and constrained optimization (primal) problem in a direct manner is not a feasible approach, which is where Lagrangian relaxation comes in as the answer. The dual Lagrangian problem translates a relaxed problem approach, that indirectly leads to solutions of the original (primal) problem. In the coordination problem, a decomposition takes place where the global solution is achieved by coordinating between the respective subproblems solutions. This dual problem is solved iteratively, and Lagrange multipliers are updated between each iteration using subgradient methods. To tackle, time-consuming tuning tasks  or user related experience, a new adaptative algorithm, is proposed to better adjust the step-size used to update Lagrange multipliers, i.e., avoid the need to pre-select  a set of parameters. A results comparison against a traditionally employed step-size update mechanism, showed that the adaptive algorithm manages to obtain improved performances in terms of the targeted primal problem. Keywords: Hydro-Thermal coordination, Lagrangian relaxation, Lagrangian dual problem, Lagrange multipliers, Subgradient method

Modeling and Optimal Operation of Hydraulic, Wind and Photovoltaic Power Generation Systems

The transition to 100% renewable energy in the future is one of the most important ways of achieving "carbon peaking and carbon neutrality" and of reducing the adverse effects of climate change. In this process, the safe, stable and economical operation of renewable energy generation systems, represented by hydro-, wind and solar power, is particularly important, and has naturally become a key concern for researchers and engineers. Therefore, this book focuses on the fundamental and applied research on the modeling, control, monitoring and diagnosis of renewable energy generation systems, especially hydropower energy systems, and aims to provide some theoretical reference for researchers, power generation departments or government agencies

Efficient Optimization and Robust Value Quantification of Enhanced Oil Recovery Strategies

With an increasing demand for hydrocarbon reservoir produces such as oil, etc., and difficulties in finding green oil fields, the use of Enhanced Oil Recovery (EOR) methods such as polymer, Smart water, and solvent flooding for further development of existing fields can not be overemphasized. For reservoir profitability and reduced environmental impact, it is crucial to consider appropriate well control settings of EOR methods for given reservoir characterization. Moreover, finding appropriate well settings requires solving a constrained optimization problem with suitable numerical solution methods. Conventionally, the solution method requires many iterations involving several computationally demanding function evaluations before convergence to the appropriate near optimum. The major subject of this thesis is to develop an efficient and accurate solution method for constrained optimization problems associated with EOR methods for their value quantifications and ranking in the face of reservoir uncertainties. The first contribution of the thesis develops a solution method based on the inexact line search method (with Ensemble Based Optimization (EnOpt) for approximate gradient computation) for robust constrained optimization problems associated with polymer, Smart water, and solvent flooding. Here, the objective function is the expectation of the Net Present Value (NPV) function over given geological realizations. For a given set of well settings, the NPV function is defined based on the EOR simulation model, which follows from an appropriate extension of the black-oil model. The developed solution method is used to find the economic benefits and also the ranking of EOR methods for different oil reservoirs developed to mimic North Sea reservoirs. Performing the entire optimization routine in a transformed domain along with truncations has been a common practice for handling simple linear constraints in reservoir optimization. Aside from the fact that this method has a negative impact on the quality of gradient computation, it is complicated to use for non-linear constraints. The second contribution of this thesis proposes a technique based on the exterior penalty method for handling general linear and non-linear constraints in reservoir optimization problems to improve gradient computation quality by the EnOpt method for efficient and improved optimization algorithm. Because of the computationally expensive NPV function due to the costly reservoir simulation of EOR methods, the solution method for the underlying EOR optimization problem becomes inefficient, especially for large reservoir problems. To speedup the overall computation of the solution method, this thesis introduces a novel full order model (FOM)-based certified adaptive machine learning optimization procedures to locally approximate the expensive NPV function. A supervised feedforward deep neural network (DNN) algorithm is employed to locally create surrogate model. In the FOM-based optimization algorithm of this study, several FOM NPV function evaluations are required by the EnOpt method to approximate the gradient function at each (outer) iteration until convergence. To limit the number FOM-based evaluations, we consider building surrogate models locally to replace the FOM based NPV function at each outer iteration and proceed with an inner optimization routine until convergence. We adapt the surrogate model using some FOM-based criterion where necessary until convergence. The demonstration of methodology for polymer optimization problem on a benchmark model results in an improved optimum and found to be more efficient compared to using the full order model optimization procedures

Exact Convex Modeling of the Optimal Power Flow for the Operation and Planning of Active Distribution Networks with Energy Storage Systems

The distribution networks are experiencing important changes driven by the massive integration of renewable energy conversion systems. However, the lack of direct controllability of the Distributed Generations (DGs) supplying Active Distribution Networks (ADNs) represents a major obstacle to the increase of the penetration of renewable energy resources characterized by a non-negligible volatility. The successful development of ADNs depends on the combination of i) specific control tools and ii) availability of new technologies and controllable resources. Within this context, this thesis focuses on developing practical and scalable methodologies for the ADN planning and operation with particular reference to the integration of Energy Storage Systems (ESSs) owned, and directly controlled, by the Distribution Network Operators (DNOs). In this respect, an exact convex formulation of Optimal Power Flow (OPF), called AR-OPF, is first proposed for the case of radial power networks. The proposed formulation takes into account the correct model of the lines and the security constraints related to the nodal voltage magnitudes, as well as, the lines ampacity limits. Sufficient conditions are provided to guarantee that the solution of the AR-OPF is feasible and optimal (i.e., the relaxation used is exact). Moreover, by analyzing the exactness conditions, it is revealed that they are mild and hold for real distribution networks. The AR-OPF is further augmented by suitably incorporating radiality constraints in order to develop an optimization model for optimal reconfiguration of ADNs. Then, a two-stage optimization problem for day-ahead resource scheduling in ADNs, accounting for the uncertainties of nodal injections, is proposed. The Adaptive Robust Optimization (ARO) and stochastic optimization techniques are successfully adapted to solve this optimization problem. The solutions of ARO and stochastic optimization reveal that the ARO provides a feasible solution for any realization of the uncertain parameters even if its solution is optimal only for the worst case realization. On the other hand, the stochastic optimization provides a solution taking into account the probability of the considered scenarios. Finally, the problem of optimal resource planning in ADNs is investigated with particular reference to the ESSs. In this respect, the AR-OPF and the proposed ADN reconfiguration model, are employed to develop optimization models for the optimal siting and sizing of ESSs in ADNs. The objective function aims at finding the optimal trade-off between technical and economical goals. In particular, the proposed procedures accounts for (i) network voltage deviations, (ii) feeders/lines congestions, (iii) network losses, (iv) cost of supplying loads (from external grid or local producers) together with the cost of ESS investment/maintenance, (v) load curtailment and (vi) stochasticity of loads and renewables production. The use of decomposition methods for solving the targeted optimization problems with discrete variables and probable large size is investigated. More specifically, Benders decomposition and Alternative Direction Method of Multipliers (ADMM) techniques are successfully applied to the targeted problems. Using real and standard networks, it is shown that the ESSs could possibly prevent load and generation curtailment, reduce the voltage deviations and lines congestions, and do the peak shaving

A survey of AI in operations management from 2005 to 2009

Purpose: the use of AI for operations management, with its ability to evolve solutions, handle uncertainty and perform optimisation continues to be a major field of research. The growing body of publications over the last two decades means that it can be difficult to keep track of what has been done previously, what has worked, and what really needs to be addressed. Hence this paper presents a survey of the use of AI in operations management aimed at presenting the key research themes, trends and directions of research. Design/methodology/approach: the paper builds upon our previous survey of this field which was carried out for the ten-year period 1995-2004. Like the previous survey, it uses Elsevier’s Science Direct database as a source. The framework and methodology adopted for the survey is kept as similar as possible to enable continuity and comparison of trends. Thus, the application categories adopted are: design; scheduling; process planning and control; and quality, maintenance and fault diagnosis. Research on utilising neural networks, case-based reasoning (CBR), fuzzy logic (FL), knowledge-Based systems (KBS), data mining, and hybrid AI in the four application areas are identified. Findings: the survey categorises over 1,400 papers, identifying the uses of AI in the four categories of operations management and concludes with an analysis of the trends, gaps and directions for future research. The findings include: the trends for design and scheduling show a dramatic increase in the use of genetic algorithms since 2003 that reflect recognition of their success in these areas; there is a significant decline in research on use of KBS, reflecting their transition into practice; there is an increasing trend in the use of FL in quality, maintenance and fault diagnosis; and there are surprising gaps in the use of CBR and hybrid methods in operations management that offer opportunities for future research. Design/methodology/approach: the paper builds upon our previous survey of this field which was carried out for the 10 year period 1995 to 2004 (Kobbacy et al. 2007). Like the previous survey, it uses the Elsevier’s ScienceDirect database as a source. The framework and methodology adopted for the survey is kept as similar as possible to enable continuity and comparison of trends. Thus the application categories adopted are: (a) design, (b) scheduling, (c) process planning and control and (d) quality, maintenance and fault diagnosis. Research on utilising neural networks, case based reasoning, fuzzy logic, knowledge based systems, data mining, and hybrid AI in the four application areas are identified. Findings: The survey categorises over 1400 papers, identifying the uses of AI in the four categories of operations management and concludes with an analysis of the trends, gaps and directions for future research. The findings include: (a) The trends for Design and Scheduling show a dramatic increase in the use of GAs since 2003-04 that reflect recognition of their success in these areas, (b) A significant decline in research on use of KBS, reflecting their transition into practice, (c) an increasing trend in the use of fuzzy logic in Quality, Maintenance and Fault Diagnosis, (d) surprising gaps in the use of CBR and hybrid methods in operations management that offer opportunities for future research. Originality/value: This is the largest and most comprehensive study to classify research on the use of AI in operations management to date. The survey and trends identified provide a useful reference point and directions for future research

Particle Swarm Optimization

Particle swarm optimization (PSO) is a population based stochastic optimization technique influenced by the social behavior of bird flocking or fish schooling.PSO shares many similarities with evolutionary computation techniques such as Genetic Algorithms (GA). The system is initialized with a population of random solutions and searches for optima by updating generations. However, unlike GA, PSO has no evolution operators such as crossover and mutation. In PSO, the potential solutions, called particles, fly through the problem space by following the current optimum particles. This book represents the contributions of the top researchers in this field and will serve as a valuable tool for professionals in this interdisciplinary field