Model Predictive Control Based Approach for Microgrid Energy Management

Many different methods have been presented to solve unit commitment (UC) problem in literature with different advantages and disadvantages. The need for multiple runs, huge computational burden and time, and poor convergence are some of the disadvantages, where are especially considerable in large scale systems. In this paper, a new analytical and non-iterative method is presented to solve UC problem. In the proposed method, improved pre-prepared power demand (IPPD) table is used to solve UC problem, and then analytical “λ-logic” algorithm is used to solve economic dispatch (ED) sub-problem. The analytical and non-iterative nature of the mentioned methods results in simplification of the UC problem solution. Obtaining minimum cost in very small time with only one run is the major advantage of the proposed method. The proposed method has been tested on 10 unit and 40-100 unit systems with consideration of different constraints, such as: power generation limit of units, reserve constraints, minimum up and down times of generating units. Comparing the simulation results of the proposed method with other methods in literature shows that in large scale systems, the proposed method achieves minimum operational cost within minimum computational time.

This paper presents centralized control for a wind farm using model predictive control (MPC) method. In order to solve intra-day unit commitment (UC) problem, the UC problem is solved by using the MPC method with short-term wind power forecasting. We introduce a new dynamics model for the UC with some constraints to utilize the benefits of the MPC method. The objective function considering the operation and maintenance costs is formulated by adding a new variable in order to average the operating time of each wind turbine (WT) within the whole time. The proposed method could solve the UC problems on-line using the prediction time horizon that could be selected flexibly considering time horizon based on wind power forecasting errors. From the simulation study using 10 WTs, we observed that the proposed dynamics model of UC effectively provided the optimal solution to each scenario. Numerical study will validate that the proposed method can be applied to solving the UC problem of a large scale wind farm by aggregating WTs.

Stochastic Hopfield artificial neural network for unit commitment and economic power dispatch

Using suitable solution techniques to the unit commitment (UC) and economic load dispatch (ELD) problems play major role on finding an optimal power scheduling in electrical power system. The UC and ELD problems are to decide when and which generating units to commit and decommit, in order to minimize the total fuel cost over specified period subject to a large number of difficult constraints. Lagrangian relaxation (LR) has been widely used to solve UC and ELD. Recently bundling method (BM) has appeared to be one of the best multipliers updated techniques for LR. This method has promising and the fastest convergence characteristics for UC and ELD problems. For that reason, this paper is to solve the UC and ELD problems via LR, BM and interior point method. This paper explores also the best possible way of updating Lagrangian multipliers with minimum computation time using fast programming techniques.

A layered matrix encoding cascade genetic algorithm and particle swarm optimization approach (GA-PSO) for unit commitment and economic load dispatch problem in a thermal power system is presented in this paper. The tasks of determining and allocating power generation to different thermal units in a way that the total power production cost is at the minimum subject to equality and inequality constraints makes unit commitment and economic load dispatch challenging. A case study, based on the thermal power generation problem presented in [1], is used to demonstrate the effectiveness of the proposed method in generating a cost-effective power generation schedule. The schedule obtained is compared with that of Linear Programming (LP) as reported in [1]. The results show that the proposed GA-PSO approach outperforms LP in solving the unit commitment and economic load dispatch problem for thermal power generation system in this case study.

Objectives: The main objective of this paper is to solve the Cost Based Unit Commitment (CBIC) problem considering Renewable Energy Sources (RES) and Plug-in Electric vehicles (PEVs). The proposed problem minimizes the total operating of the interconnected system. Methods: A novel and recently developed successful optimization tool of Cat and Mouse Based Optimizer (CMBO) is proposed for optimal solution of Cost Based UC problem. The proposed CMBO approach is having two groups such as Cat group and Mice group for searching the global optimal solution with less computational time. It contains two phases like Cat’s movement towards Mice and Mice escape to a safe place is effectively updating the new position of Cat and Mice to easily reaching the best solutions. The control parameter of CMBO is number of agents is 50, number of variables is 10 and maximum number of iteration is 500. MATLAB 14.0 platform is utilized for the projected problem. Findings: The method tested on standard IEEE-39 bus system (10 generators and 24 hour) with an equivalent PEV and Wind farm. The CMBO approach minimize the total operating cost with various test cases. The outcomes such as UC schedule, Real power output of thermal, wind and PEV units, fuel cost, startup cost and total operating cost of the interconnected system are numerically and graphically reported. The total operating cost is 4.11 % minimized when compared with base case approach and 0.73 % reduced than the other existing method viz. Parallel UCs-RP method. Novelty: The CMBO is recently developed powerful optimizer and parameter free algorithm, so easily reaches the global optimal solutions. The obtained simulated results are compared with other mathematical and intelligent computational approaches for proving the efficiency and performance of the proposed CNBO technique. Keywords: Unit Commitment, Plug­in Electric Vehicles, Renewable Energy Sources, Cost minimization, Cat and Mouse Based Optimizer

An optimal solution to the unit commitment (UC) and economic load dispatch (ELD) problems lead to remarkable saving in the power system operational cost. UC and ELD main problems are to find the maximum profit and fast computation simulation time for the scheduling program. Lagrangian relaxation (LR) has become one of the best solution methods in solving the UC and ELD problems. The approach is claimed to be more efficient and easier than other methods in solving large-scale problems. When applying LR, the dual function needed to be updated at the higher level. Lately, bundling method (BM) is one of the best solution methods to Lagrangian dual problem. This paper presents LR technique, BM and interior point method for solving the UC and ELD problems. It will also explore the best possible way of updating Lagrangian multipliers with minimum computation time using fast programming techniques.

In this paper, Security Constrained Unit Commitment (SCUC) problem with combined Thermal- Solar generating units is solved using Artificial Bee Colony (ABC) algorithm. SCUC problem aims to obtain minimum generation cost while satisfying the system, network and security constraints. The SCUC problem is divided into Unit Commitment Problem (UCP) which is considered as the master problem and Security Constrained Economic Dispatch (SCED) is considered as the sub problem. Here, both thermal and solar generations are considered in UCP and SCED solutions. Binary Coded ABC Algorithm is used to solve the UCP and Real Coded ABC Algorithm is used for solving the SCED problem. The constraints such as spinning reserves, hourly load demands, ramp up/ramp down limits of generators, minimum up/down limits, line flow and voltage limits are considered in the problem formulation. Beta distribution function is employed to forecast the solar power generation in different seasons. The comparison is carried out with and without incorporating solar generation. The proposed method is validated on a 6 bus system and a South Indian 86 bus utility.

This chapter describes and formulates three important problems for the economic management of power systems, namely, the Unit Commitment (UC), the Economic Dispatch (ED), and the Network Constrained Unit Commitment (NCUC) problems. The UC problem determines the commitment of generating units with the aim of minimizing operating costs while supplying the demand and meeting technical and security constraints. Then, once the commitment of generating units is decided, the ED problem determines the actual power output of each generating unit that is needed to supply all demands at minimum cost, while complying with the technical constraints of the transmission network. Finally, if both the commitment of generating units and transmission constraints are considered simultaneously, the resulting problem is known as the NCUC problem. These three problems are mostly considered in electricity markets throughout the US.

Solving non-convex economic load dispatch problem via artificial cooperative search algorithm

Economical dispatch of power is a significant real time optimization problem in the operation of power system, which allocates the loads on the committed generating units to reduce the generation cost, while meeting all the inequality and equality constraints. Traditionally, economic load dispatch problems have been formulated as convex optimization problem and various classical methods such as gradient methods, base-point participation factor method, etc. have been used for solving them. The traditional formulation is a quadratic input-output curve or piece wise linear cost curve, which are continuous and convex, however, real generating units have valve loading effects, which make the cost curve discontinuous and non-convex and hence the economic dispatch problem is no longer simple to handle. Thus, the classical methods cannot be employed for non-convex problems. The non-convex, non-linear and discontinuous economic dispatch (ED) problem can be better solved by metaheuristic approaches. Such approaches often require tuning of their respective evolutionary parameters. Although, solution to such type of problem have already been solved by different metaheuristic optimization techniques in previous studies as well, however, the algorithm employed in this paper to solve Power Economic Load Dispatch (PELD) problem is adaptive real coded quantum-inspired evolutionary algorithm, which does not require tuning of evolutionary parameters and performs better than some of the existing techniques on standard 6-bus 3 machine system and IEEE 14 bus 5 unit system.

The paper presents a stochastic Hopfield artificial neural network for unit commitment and economic power dispatch. Because of uncertainties in both the system load demand and unit availability, the unit commitment and economic power dispatch problem is stochastic, in this paper we model forced unit outages as independent Markov processes, and load demand as a normal Gaussian random variable. The (0,1) unit commitment-status variables and the hourly unit loading are modelled as sample functions of appropriate random processes. They are solutions of appropriately derived stochastic differential equations which describe the dynamics of a stochastic system for which the operating cost function is a stochastic Lyapunov function. Once the unit commitment and economic power dispatch have been done, the corresponding production costs are computed.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

This paper proposes an innovative genetic algorithm (GA) approach to solve the thermal unit commitment (UC) problem in power generation industry through a constraint satisfaction technique. Due to a large variety of constraints to be satisfied, the solution space of the UC problem is highly nonconvex, and therefore the UC problem can not be solved efficiently by the standard GA. To effectively deal with the constraints of the problem and greatly reduce the search space of the GA, the minimum up- and down-time constraints are embedded in the binary strings that are coded to represent the on-off states of the generating units. The violations of the other constraints are handled by integrating penalty factors into the cost function. Numerical results on the practical Taiwan Power (Taipower) system of 38 thermal units over a 24-hour period show that the features of easy implementation, fast convergence, and highly near-optimal solution in solving the UC problem can be achieved by the proposed GA approach. >

The ESS is considered as an effective tool for enhancing the flexibility and controllability of a wind farm, and the optimal control scheme of a wind farm with distributed ESSs is vital to the stable operation of wind power generation. In this paper, a coordinated active and reactive power control strategy based on model predictive control (MPC) is proposed for doubly fed induction generator (DFIG)-based wind farm (WF) with distributed energy storage systems (ESSs). The proposed control scheme coordinates the active and reactive power output among DFIG wind turbines (WTs), grid-side converters (GSCs), and distributed ESSs inside the WF, and the aim is to decrease fatigue loads of WTs, make the WT terminal voltage inside the extent practicable, and take the WF economic operation into consideration. Moreover, the best reactive power references of DFIG stator and GSC are produced independently based on their dynamics. At last, the control scheme generates optimal power references for all ESS to make the SOC of each ESS converge to their average state. With the distributed ESSs, the WF controller regulates the WTs inside WF more flexibly. A WF composed of 10 DFIG WTs was utilized to verify the control performance of the proposed coordinated active and reactive power control strategy.

In recent years, high penetration of variable generating sources, such as wind power, has challenged independent system operators (ISO) in keeping a cheap and reliable power system operation. Any deviation between expected and real wind production must be absorbed by the power system resources (reserves), which must be available and ready to be deployed in real time. To guarantee this resource availability, the system resources must be committed in advance, usually the day-ahead, by solving the so-called unit commitment (UC) problem. If the quantity of committed resources is extremely low, there will be devastating and costly consequences in the system, such as significant load shedding. On the other hand, if this quantity is extremely high, the system operation will be excessively expensive, mainly because facilities will not be fully exploited. This thesis proposes computationally efficient models for optimal day-ahead planning in (thermal) power systems to adequately face the stochastic nature of wind production in the real-time system operation. The models can support ISOs to face the new challenges in short-term planning as uncertainty increases dramatically due to the integration of variable generating resources. This thesis then tackles the UC problem in the following aspects: Power system representation: This thesis identifies drawbacks of the traditional energy-block scheduling approach, which make it unable to adequately prepare the power system to face deterministic and perfectly known events. To overcome those drawbacks, we propose the ramp-based scheduling approach that more accurately describes the system operation, thus better exploiting the system flexibility. UC computational performance: Developing more accurate models would be pointless if these models considerably increase the computational burden of the UC problem, which is already a complex integer and non-convex problem. We then devise simultaneously tight and compact formulations under the mixed-integer programming (MIP) approach. This simultaneous characteristic reinforces the convergence speed by reducing the search space (tightness) and simultaneously increasing the searching speed (compactness) with which solvers explore that reduced space. Uncertainty management in UC: By putting together the improvements in the previous two aspects, this thesis contributes to a better management of wind uncertainty in UC, even though these two aspects are in conflict and improving one often means harming the other. If compared with a traditional energy-block UC model under the stochastic (deterministic) paradigm, a stochastic (deterministic) ramp-based UC model: 1) leads to more economic operation, due to a better and more detailed system representation, while 2) being solved significantly faster, because the core of the model is built upon simultaneously tight and compact MIP formulations. To further improve the uncertainty management in the proposed ramp-based UC, we extend the formulation to a network-constrained UC with robust reserve modelling. Based on robust optimization insights, the UC solution guarantees feasibility for any realization of the uncertain wind production, within the considered uncertainty ranges. This final model remains as a pure linear MIP problem whose size does not depend on the uncertainty representation, thus avoiding the inherent computational complications of the stochastic and robust UCs commonly found in the literature.