An Evolutionary Computational Approach for the Problem of Unit Commitment and Economic Dispatch in Microgrids under Several Operation Modes

In the last decades, new types of generation technologies have emerged and have been gradually integrated into the existing power systems, moving their classical architectures to distributed systems. Despite the positive features associated to this paradigm, new problems arise such as coordination and uncertainty. In this framework, microgrids constitute an effective solution to deal with the coordination and operation of these distributed energy resources. This paper proposes a Genetic Algorithm (GA) to address the combined problem of Unit Commitment (UC) and Economic Dispatch (ED). With this end, a model of a microgrid is introduced together with all the control variables and physical constraints. To optimally operate the microgrid, three operation modes are introduced. The first two attend to optimize economical and environmental factors, while the last operation mode considers the errors induced by the uncertainties in the demand forecasting. Therefore, it achieves a robust design that guarantees the power supply for different confidence levels. Finally, the algorithm was applied to an example scenario to illustrate its performance. The achieved simulation results demonstrate the validity of the proposed approach.Ministerio de Ciencia, Innovación y Universidades TEC2016-80242-PMinisterio de Economía y Competitividad PCIN-2015-043Universidad de Sevilla Programa propio de I+D+

AI-Driven Security Constrained Unit Commitment Using Predictive Modeling And Eigen Decomposition

Security Constrained Unit Commitment (SC-UC) is a complex large scale mix integer constrained optimization problem solved by Independent System Operators (ISOs) in the daily planning of the electricity markets. After receiving offers and bids, ISOs have only few hours to clear the day-ahead electricity market. It requires a lot of computational effort and a reasonable time to solve a large-scale SC-UC problem. However, exploiting the fact that a UC problem is solved several times a day with only minor changes in the system data, the computational effort can be reduced by learning from the historical data and identifying the patterns in the historical data using data mining techniques. In this research study, two data driven approaches based on predictive modeling techniques are proposed to solve a SC-UC problem in a day ahead electricity market which can be used as alternative backup methods for solving a SC-UC problem. In the first approach, the SC-UC is partially modeled using predictive modeling techniques to enhance the computational speed of the problem, while in the second approach, the optimization problem is completely replaced by data driven predictive models to further enhance the computational efficiency, however, at the cost of some optimality loss. The proposed approaches are validated through numerical simulations on different IEEE case studies to demonstrate and study the effectiveness of the developed approaches. The results obtained from the proposed approaches are compared with those obtained from commercial optimization solvers e.g., IBM CPLEX MIQP and GUROBI MIQP solvers

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

The 1/5-th Rule with Rollbacks: On Self-Adjustment of the Population Size in the (1+(λ,λ))(1+(\lambda,\lambda)) GA

Self-adjustment of parameters can significantly improve the performance of evolutionary algorithms. A notable example is the $(1+(\lambda,\lambda))$ genetic algorithm, where the adaptation of the population size helps to achieve the linear runtime on the OneMax problem. However, on problems which interfere with the assumptions behind the self-adjustment procedure, its usage can lead to performance degradation compared to static parameter choices. In particular, the one fifth rule, which guides the adaptation in the example above, is able to raise the population size too fast on problems which are too far away from the perfect fitness-distance correlation. We propose a modification of the one fifth rule in order to have less negative impact on the performance in scenarios when the original rule reduces the performance. Our modification, while still having a good performance on OneMax, both theoretically and in practice, also shows better results on linear functions with random weights and on random satisfiable MAX-SAT instances.Comment: 17 pages, 2 figures, 1 table. An extended two-page abstract of this work will appear in proceedings of the Genetic and Evolutionary Computation Conference, GECCO'1

Metaheuristics for the unit commitment problem : The Constraint Oriented Neighbourhoods search strategy

Tese de mestrado. Faculdade de Engenharia. Universidade do Porto. 199