Online Energy Generation Scheduling for Microgrids with Intermittent Energy Sources and Co-Generation

Microgrids represent an emerging paradigm of future electric power systems that can utilize both distributed and centralized generations. Two recent trends in microgrids are the integration of local renewable energy sources (such as wind farms) and the use of co-generation (i.e., to supply both electricity and heat). However, these trends also bring unprecedented challenges to the design of intelligent control strategies for microgrids. Traditional generation scheduling paradigms rely on perfect prediction of future electricity supply and demand. They are no longer applicable to microgrids with unpredictable renewable energy supply and with co-generation (that needs to consider both electricity and heat demand). In this paper, we study online algorithms for the microgrid generation scheduling problem with intermittent renewable energy sources and co-generation, with the goal of maximizing the cost-savings with local generation. Based on the insights from the structure of the offline optimal solution, we propose a class of competitive online algorithms, called CHASE (Competitive Heuristic Algorithm for Scheduling Energy-generation), that track the offline optimal in an online fashion. Under typical settings, we show that CHASE achieves the best competitive ratio among all deterministic online algorithms, and the ratio is no larger than a small constant 3.Comment: 26 pages, 13 figures. It will appear in Proc. of ACM SIGMETRICS, 201

Artificial neural network based generation scheduling: a case study for Belgium's national grid

Modern power system energy management system involves generation scheduling as one of the core components. Generation scheduling function has to satisfy the main objective of economics, which involves an optimization of cost over a future period of time. Also it depends on the availability of the various types of generation. The present paper describes an artificial neural network (ANN) based method for scheduling of generation for the national grid of Belgium. The supervised multilayer perceptron based training produces satisfactory results in scheduling of non-renewable energy sources, with prior information on the availability of renewable energy sources.Keywords:Artificial neural network, generation scheduling, non-renewable energy, renewable source

An Evolutionary Generation Scheduling in an Open Electricity Market

YesThe classical generation scheduling problem defines on/off decisions (commitment) and dispatch level of all available generators in a power system for each scheduling period. In recent years researchers have focused on developing new approaches to solve nonclassical generation scheduling problems in the newly deregulated and decentralized electricity market place. In this paper a GA-based approach has been developed for a system operator to schedule generation in a market akin to that operating in England and Wales. A generation scheduling problem has been formulated and solved using available trading information at the time of dispatch. The solution is updated after information is obtained in a rolling fashion. The approach is tested for two IEEE network-based problems, and achieves comparable results with a branch and bound technique in reasonable CPU time

Reinforcement Learning for the Unit Commitment Problem

In this work we solve the day-ahead unit commitment (UC) problem, by formulating it as a Markov decision process (MDP) and finding a low-cost policy for generation scheduling. We present two reinforcement learning algorithms, and devise a third one. We compare our results to previous work that uses simulated annealing (SA), and show a 27% improvement in operation costs, with running time of 2.5 minutes (compared to 2.5 hours of existing state-of-the-art).Comment: Accepted and presented in IEEE PES PowerTech, Eindhoven 2015, paper ID 46273

A review of optimal operation of microgrids

The term microgrid refers to small-scale power grid that can operate autonomously or in concurrence with the area’s main electrical grid. The intermittent characteristic of DGs which defies the power quality and voltage manifests the requirement for new planning and operation approaches for microgrids. Consequently, conventional optimization methods in new power systems have been critically biased all through the previous decade. One of the main technological and inexpensive tools in this regard is the optimal generation scheduling of microgrid. As a primary optimization tool in the planning and operation fields, optimal operation has an undeniable part in the power system. This paper reviews and evaluates the optimal operation approaches mostly related to microgrids. In this work, the foremost optimal generation scheduling approaches are compared in terms of their objective functions, techniques and constraints. To conclude, a few fundamental challenges occurring from the latest optimal generation scheduling techniques in microgrids are addressed

Trainable Variational Quantum-Multiblock ADMM Algorithm for Generation Scheduling

The advent of quantum computing can potentially revolutionize how complex problems are solved. This paper proposes a two-loop quantum-classical solution algorithm for generation scheduling by infusing quantum computing, machine learning, and distributed optimization. The aim is to facilitate employing noisy near-term quantum machines with a limited number of qubits to solve practical power system optimization problems such as generation scheduling. The outer loop is a 3-block quantum alternative direction method of multipliers (QADMM) algorithm that decomposes the generation scheduling problem into three subproblems, including one quadratically unconstrained binary optimization (QUBO) and two non-QUBOs. The inner loop is a trainable quantum approximate optimization algorithm (T-QAOA) for solving QUBO on a quantum computer. The proposed T-QAOA translates interactions of quantum-classical machines as sequential information and uses a recurrent neural network to estimate variational parameters of the quantum circuit with a proper sampling technique. T-QAOA determines the QUBO solution in a few quantum-learner iterations instead of hundreds of iterations needed for a quantum-classical solver. The outer 3-block ADMM coordinates QUBO and non-QUBO solutions to obtain the solution to the original problem. The conditions under which the proposed QADMM is guaranteed to converge are discussed. Two mathematical and three generation scheduling cases are studied. Analyses performed on quantum simulators and classical computers show the effectiveness of the proposed algorithm. The advantages of T-QAOA are discussed and numerically compared with QAOA which uses a stochastic gradient descent-based optimizer.Comment: 11 page

Two-Step Optimal Thermal Generation Scheduling

A new approach to the solution of the optimal thermal generation scheduling problem is presented. The problem is solved in two steps. As a first step, the optimal production schedule for the next day is obtained based on a daily load forecast, reserve capacity requirements, and present status of generating units. The second-step algorithm uses the results of the first step and adjusts the previous schedule to meet new constraints developed during the course of the day. Variable truncation dynamic programming is proposed as a new method to reduce computation effort. To eliminate the need for solving the entire problem again in the second step, a new technique that limits the solution space to be searched is presented. Use of approach is illustrated via examples

Power systems generation scheduling and optimisation using evolutionary computation techniques

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.Optimal generation scheduling attempts to minimise the cost of power production while satisfying the various operation constraints and physical limitations on the power system components. The thermal generation scheduling problem can be considered as a power system control problem acting over different time frames. The unit commitment phase determines the optimum pattern for starting up and shutting down the generating units over the designated scheduling period, while the economic dispatch phase is concerned with allocation of the load demand among the on-line generators. In a hydrothermal system the optimal scheduling of generation involves the allocation of generation among the hydro electric and thermal plants so as to minimise total operation costs of thermal plants while satisfying the various constraints on the hydraulic and power system network. This thesis reports on the development of genetic algorithm computation techniques for the solution of the short term generation scheduling problem for power systems having both thermal and hydro units. A comprehensive genetic algorithm modelling framework for thermal and hydrothermal scheduling problems using two genetic algorithm models, a canonical genetic algorithm and a deterministic crowding genetic algorithm, is presented. The thermal scheduling modelling framework incorporates unit minimum up and down times, demand and reserve constraints, cooling time dependent start up costs, unit ramp rates, and multiple unit operating states, while constraints such as multiple cascade hydraulic networks, river transport delays and variable head hydro plants, are accounted for in the hydraulic system modelling. These basic genetic algorithm models have been enhanced, using quasi problem decomposition, and hybridisation techniques, resulting in efficient generation scheduling algorithms. The results of the performance of the algorithms on small, medium and large scale power system problems is presented and compared with other conventional scheduling techniques.Overseas Development Agenc

Optimal generation scheduling in hydro-power plants with the Coral Reefs Optimization algorithm

Hydro-power plants are able to produce electrical energy in a sustainable way. A known format for producing energy is through generation scheduling, which is a task usually established as a Unit Commitment problem. The challenge in this process is to define the amount of energy that each turbine-generator needs to deliver to the plant, to fulfill the requested electrical dispatch commitment, while coping with the operational restrictions. An optimal generation scheduling for turbine-generators in hydro-power plants can offer a larger amount of energy to be generated with respect to non-optimized schedules, with significantly less water consumption. This work presents an efficient mathematical modelling for generation scheduling in a real hydro-power plant in Brazil. An optimization method based on different versions of the Coral Reefs Optimization algorithm with Substrate Layers (CRO) is proposed as an effective method to tackle this problem.This approach uses different search operators in a single population to refine the search for an optimal scheduling for this problem. We have shown that the solution obtained with the CRO using Gaussian search in exploration is able to produce competitive solutions in terms of energy production. The results obtained show a huge savings of 13.98 billion (liters of water) monthly projected versus the non-optimized scheduling.European CommissionMinisterio de Economía y CompetitividadComunidad de Madri