Optimal energy management of a microgrid system

Mestrado de dupla diplomação com École Superieure en Sciences AppliquéesA smart management strategy for the energy ows circulating in microgrids is necessary to economically manage local production and consumption while maintaining the balance between supply and demand. Finding the optimum set-points of the various generators and the best scheduling of the microgrid generators can lead to moderate and judicious use of the powers available in the microgrid. This thesis aims to apply an energy management system based on optimization algorithms to ensure the optimal control of microgrids by taking as main purpose the minimization of the energy costs and reduction of the gas emissions rate responsible for greenhouse gases. Two approaches have been proposed to nd the optimal operating setpoints. The rst one is based on a uni-objective optimization approach in which several energy management systems are implemented for three case studies. This rst approach treats the optimization problem in a uni-objective way where the two functions price and gas emission are treated separately through optimization algorithms. In this approach the used methods are simplex method, particle swarm optimization, genetic algorithm and a hybrid method (LPPSO). The second situation is based on a multiobjective optimization approach that deals with the optimization of the two functions: cost and gas emission simultaneously, the optimization algorithm used for this purpose is Pareto-search. The resulting Pareto optimal points represent di erent scheduling scenarios of the microgrid system.Uma estrat egia de gest~ao inteligente dos uxos de energia que circulam numa microrrede e necess aria para gerir economicamente a produ c~ao e o consumo local, mantendo o equil brio entre a oferta e a procura. Encontrar a melhor programa c~ao dos geradores de microrrede pode levar a uma utiliza c~ao moderada e criteriosa das pot^encias dispon veis na microrrede. Esta tese visa desenvolver um sistema de gest~ao de energia baseado em algoritmos de otimiza c~ao para assegurar o controlo otimo das microrredes, tendo como objetivo principal a minimiza c~ao dos custos energ eticos e a redu c~ao da taxa de emiss~ao de gases respons aveis pelo com efeito de estufa. Foram propostas duas estrat egias para encontrar o escalonamento otimo para funcionamento. A primeira baseia-se numa abordagem de otimiza c~ao uni-objetivo no qual v arios sistemas de gest~ao de energia s~ao implementados para tr^es casos de estudo. Neste caso o problema de otimiza c~ao e baseado na fun c~ao pre co e na fun c~ao emiss~ao de gases. Os m etodos de otimiza c~ao utilizados foram: algoritmo simplex, algoritmos gen eticos, particle swarm optimization e m etodo h brido (LP-PSO). A segunda situa c~ao baseia-se numa abordagem de otimiza c~ao multi-objetivo que trata a otimiza c~ao das duas fun c~oes: custo e emiss~ao de gases em simult^aneo. O algoritmo de otimiza c~ao utilizado para este m foi a Procura de Pareto. Os pontos otimos de Pareto resultantes representam diferentes cen arios de programa c~ao do sistema de microrrede

Mathematical models and analysis for demand side management in residential electricity distribution networks.

Development of smart grids along with communication technologies have led to the increased attention and adoption of demand side management (DSM) in the residential sector. Among various DSM schemes, demand response (DR) is a market- based mechanism to shave peak electricity consumption at the system level. In the past decade, the academia has seen a growing literature studying load management methodologies for residential consumers. A typical demand response program has three important facets: the energy cost, comfort of the consumers and overall system efficiency. In this dissertation, we investigate and develop models for effective load control to minimize energy cost and for understanding electricity consumer behavior so as to best design DR schemes. Participation in a real-world field demonstration not only stimulated our motivation for these studies, but also provided us with real- world data to validate the developed models and analyses. This in fact makes the dissertation distinct from current academic literature. We first develop a control algorithm for Heating Ventilation Air-Conditioning (HVAC) systems in households during a peak period. The dynamic programming based model can determine the optimal temperature set-points of a thermostat given the lower and upper limits of temperature that household feels comfortable and the desired duration of the control. The temperature limits act as a quantitative metric for the comfort level of consumers. The objective is to minimize the energy consumption. The model is particularly suitable for DR programs with critical peak pricing, in which a higher electricity rate occurs during the peak period. When deployed separately during the peak and adjoining two periods, the model can keep the inside temperature within the given limits while consuming minimal energy during the peak period. This ensures that the HVAC system would have minimal usage during the peak period as the temperature is kept within the limits. In addition, we show that alternative start and end times of the control algorithm can be tested for each home. Analyses of the alternative options provide us with information about the insulation of the building. We perform computational experiments with real-world data to show the efficacy of the proposed methodology. Second, we propose a mixed-integer linear fractional programming (MILFP) model to optimally deploy the dynamic programming based HVAC controllers among a pool of homes in a staggered fashion. Doing so, the model aims to flatten the demand curve over time thus maximizing the load factor for the entire distribution network. In addition, we develop a reformulation of the MILFP model into an MILP model which significantly reduces computational time for medium-scale instances. Furthermore, for large-scale instances, excessive computational times by general purpose solvers motivate us to develop a customized bi-section search algorithm. Our extensive computational experiments conclude that the customized algorithm is able to solve real-world as well as randomly generated instances in reasonable CPU times. In another effort, we study the behavior of consumers when subject to dynamic pricing under a DR program. We model the price-responsive behavior with utility functions and develop a bi-level programming model to estimate the coefficients of such a function utilizing consumption data from advanced metering infrastructure (AMI) from the field demonstration project mentioned previously. The upper level objective is to minimize the estimation error between the measured data and the optimum consumption while the lower level is for each household/consumer to maximize their total utility of energy consumption. We propose a trust-region algorithm to solve the non-linear bi-level utility estimation (BLUE) model after employing linear and quadratic approximation for the upper and lower level objective function, respectively. A mathematical property of the optimal solution is exploited to develop a cut that has significantly improved the computational time. Numerical experiments with real world data are conducted to validate the proposed models. In addition, we show the strong positive correlation between the utility coefficients and the widely used price elasticity property. Finally, this dissertation also presents several empirical models to assess the effect of smart technologies on electricity consumption under a demand charge dynamic pricing rate. The models developed here were being utilized in the aforementioned demand response pilot study. We present a statistical test based model to estimate the change of coincident load of residential consumers with the installation of efficient appliances including heat pump water heaters, smart thermostats, and battery storage units. The method utilizes a day matching algorithm to pair days with similar weather conditions. The consumption data from the two paired up days are used to conduct a paired t-test to evaluate the statistical significance of the changes. The results reveal that insulation plays an important role in energy savings along with battery systems

Revisión de la optimización de Bess en sistemas de potencia

The increasing penetration of Distributed Energy Resources has imposed several challenges in the analysis and operation of power systems, mainly due to the uncertainties in primary resource. In the last decade, implementation of Battery Energy Storage Systems in electric networks has caught the interest in research since the results have shown multiple positive effects when deployed optimally. In this paper, a review in the optimization of battery storage systems in power systems is presented. Firstly, an overview of the context in which battery storage systems are implemented, their operation framework, chemistries and a first glance of optimization is shown. Then, formulations and optimization frameworks are detailed for optimization problems found in recent literature. Next, A review of the optimization techniques implemented or proposed, and a basic explanation of the more recurrent ones is presented. Finally, the results of the review are discussed. It is concluded that optimization problems involving battery storage systems are a trending topic for research, in which a vast quantity of more complex formulations have been proposed for Steady State and Transient Analysis, due to the inclusion of stochasticity, multi-periodicity and multi-objective frameworks. It was found that the use of Metaheuristics is dominant in the analysis of complex, multivariate and multi-objective problems while relaxations, simplifications, linearization, and single objective adaptations have enabled the use of traditional, more efficient, and exact techniques. Hybridization in metaheuristics has been important topic of research that has shown better results in terms of efficiency and solution quality.La creciente penetración de recursos distribuidos ha impuesto desafíos en el análisis y operación de sistemas de potencia, principalmente debido a incertidumbres en los recursos primarios. En la última década, la implementación de sistemas de almacenamiento por baterías en redes eléctricas ha captado el interés en la investigación, ya que los resultados han demostrado efectos positivos cuando se despliegan óptimamente. En este trabajo se presenta una revisión de la optimización de sistemas de almacenamiento por baterías en sistemas de potencia. Pare ello se procedió, primero, a mostrar el contexto en el cual se implementan los sistemas de baterías, su marco de operación, las tecnologías y las bases de optimización. Luego, fueron detallados la formulación y el marco de optimización de algunos de los problemas de optimización encontrados en literatura reciente. Posteriormente se presentó una revisión de las técnicas de optimización implementadas o propuestas recientemente y una explicación básica de las técnicas más recurrentes. Finalmente, se discutieron los resultados de la revisión. Se obtuvo como resultados que los problemas de optimización con sistemas de almacenamiento por baterías son un tema de tendencia para la investigación, en el que se han propuesto diversas formulaciones para el análisis en estado estacionario y transitorio, en problemas multiperiodo que incluyen la estocasticidad y formulaciones multiobjetivo. Adicionalmente, se encontró que el uso de técnicas metaheurísticas es dominante en el análisis de problemas complejos, multivariados y multiobjetivo, mientras que la implementación de relajaciones, simplificaciones, linealizaciones y la adaptación mono-objetivo ha permitido el uso de técnicas más eficientes y exactas. La hibridación de técnicas metaheurísticas ha sido un tema relevante para la investigación que ha mostrado mejorías en los resultados en términos de eficiencia y calidad de las soluciones

Improvement of the branch and bound algorithm for solving the knapsack linear integer problem

The paper presents a new reformulation approach to reduce the complexity of a branch and bound algorithm for solving the knapsack linear integer problem. The branch and bound algorithm in general relies on the usual strategy of first relaxing the integer problem into a linear programing (LP) model. If the linear programming optimal solution is integer then, the optimal solution to the integer problem is available. If the linear programming optimal solution is not integer, then a variable with a fractional value is selected to create two sub-problems such that part of the feasible region is discarded without eliminating any of the feasible integer solutions. The process is repeated on all variables with fractional values until an integer solution is found. In this approach variable sum and additional constraints are generated and added to the original problem before solving. In order to do this the objective bound of knapsack problem is quickly determined. The bound is then used to generate a set of variable sum limits and four additional constraints. From the variable sum limits, initial sub-problems are constructed and solved. The optimal solution is then obtained as the best solution from all the sub-problems in terms of the objective value. The proposed procedure results in sub-problems that have reduced complexity and easier to solve than the original problem in terms of numbers of branch and bound iterations or sub-problems.The knapsack problem is a special form of the general linear integer problem. There are so many types of knapsack problems. These include the zero-one, multiple, multiple-choice, bounded, unbounded, quadratic, multi-objective, multi-dimensional, collapsing zero-one and set union knapsack problems. The zero-one knapsack problem is one in which the variables assume 0 s and 1 s only. The reason is that an item can be chosen or not chosen. In other words there is no way it is possible to have fractional amounts or items. This is the easiest class of the knapsack problems and is the only one that can be solved in polynomial by interior point algorithms and in pseudo-polynomial time by dynamic programming approaches. The multiple-choice knapsack problem is a generalization of the ordinary knapsack problem, where the set of items is partitioned into classes. The zero-one choice of taking an item is replaced by the selection of exactly one item out of each class of item

Improvement of the branch and bound algorithm for solving the knapsack linear integer problem

The paper presents a new reformulation approach to reduce the complexity of a branch and bound algorithm for solving the knapsack linear integer problem. The branch and bound algorithm in general relies on the usual strategy of first relaxing the integer problem into a linear programing (LP) model. If the linear programming optimal solution is integer then, the optimal solution to the integer problem is available. If the linear programming optimal solution is not integer, then a variable with a fractional value is selected to create two sub-problems such that part of the feasible region is discarded without eliminating any of the feasible integer solutions. The process is repeated on all variables with fractional values until an integer solution is found. In this approach variable sum and additional constraints are generated and added to the original problem before solving. In order to do this the objective bound of knapsack problem is quickly determined. The bound is then used to generate a set of variable sum limits and four additional constraints. From the variable sum limits, initial sub-problems are constructed and solved. The optimal solution is then obtained as the best solution from all the sub-problems in terms of the objective value. The proposed procedure results in sub-problems that have reduced complexity and easier to solve than the original problem in terms of numbers of branch and bound iterations or sub-problems.The knapsack problem is a special form of the general linear integer problem. There are so many types of knapsack problems. These include the zero-one, multiple, multiple-choice, bounded, unbounded, quadratic, multi-objective, multi-dimensional, collapsing zero-one and set union knapsack problems. The zero-one knapsack problem is one in which the variables assume 0 s and 1 s only. The reason is that an item can be chosen or not chosen. In other words there is no way it is possible to have fractional amounts or items. This is the easiest class of the knapsack problems and is the only one that can be solved in polynomial by interior point algorithms and in pseudo-polynomial time by dynamic programming approaches. The multiple-choice knapsack problem is a generalization of the ordinary knapsack problem, where the set of items is partitioned into classes. The zero-one choice of taking an item is replaced by the selection of exactly one item out of each class of item

A review on economic and technical operation of active distribution systems

© 2019 Elsevier Ltd Along with the advent of restructuring in power systems, considerable integration of renewable energy resources has motivated the transition of traditional distribution networks (DNs) toward new active ones. In the meanwhile, rapid technology advances have provided great potentials for future bulk utilization of generation units as well as the energy storage (ES) systems in the distribution section. This paper aims to present a comprehensive review of recent advancements in the operation of active distribution systems (ADSs) from the viewpoint of operational time-hierarchy. To be more specific, this time-hierarchy consists of two stages, and at the first stage of this time-hierarchy, four major economic factors, by which the operation of traditional passive DNs is evolved to new active DNs, are described. Then the second stage of the time-hierarchy refers to technical management and power quality correction of ADSs in terms of static, dynamic and transient periods. In the end, some required modeling and control developments for the optimal operation of ADSs are discussed. As opposed to previous review papers, potential applications of devices in the ADS are investigated considering their operational time-intervals. Since some of the compensating devices, storage units and generating sources may have different applications regarding the time scale of their utilization, this paper considers real scenario system operations in which components of the network are firstly scheduled for the specified period ahead; then their deviations of operating status from reference points are modified during three time-intervals covering static, dynamic and transient periods

Optimal Home Energy Management System for Committed Power Exchange Considering Renewable Generations

This thesis addresses the complexity of SH operation and local renewable resources optimum sizing. The effect of different criteria and components of SH on the size of renewable resources and cost of electricity is investigated. Operation of SH with the optimum size of renewable resources is evaluated to study SH annual cost. The effectiveness of SH with committed exchange power functionality is studied for minimizing cost while responding to DR programs