The optimal solution for unit commitment problem using binary hybrid grey wolf optimizer

The aim of this work is to solve the unit commitment (UC) problem in power systems by calculating minimum production cost for the power generation and finding the best distribution of the generation among the units (units scheduling) using binary grey wolf optimizer based on particle swarm optimization (BGWOPSO) algorithm. The minimum production cost calculating is based on using the quadratic programming method and represents the global solution that must be arriving by the BGWOPSO algorithm then appearing units status (on or off). The suggested method was applied on “39 bus IEEE test systems”, the simulation results show the effectiveness of the suggested method over other algorithms in terms of minimizing of production cost and suggesting excellent scheduling of units.

Analysis of infeasible unit-commitment solutions arising in energy optimization

The day-ahead problem of finding optimal dispatch and prices for the Brazilian power system is modeled as a mixed-integer problem, with nonconvexities related to fixed costs and minimal generation requirements for some thermal power plants. The computational tool DESSEM is currently run by the independent system operator, to define the dispatch for the next day in the whole country. DESSEM also computes marginal costs of operation that CCEE, the trading chamber, uses to determine the hourly prices for energy commercialization. The respective models sometimes produce an infeasible output. This work analyzes theoretically those infeasibilities, and proposes a prioritization to progressively resolve the constraint violation, in a manner that is sound from the practical point of view. Pros and cons of different mathematical formulations are analyzed. Special attention is put on robustness of the model, when the optimality requirements for the unit-commitment problem vary.

Non-convex nested Benders decomposition

We propose a new decomposition method to solve multistage non-convex mixed-integer (stochastic) nonlinear programming problems (MINLPs). We call this algorithm non-convex nested Benders decomposition (NC-NBD). NC-NBD is based on solving dynamically improved mixed-integer linear outer approximations of the MINLP, obtained by piecewise linear relaxations of nonlinear functions. Those MILPs are solved to global optimality using an enhancement of nested Benders decomposition, in which regularization, dynamically refined binary approximations of the state variables and Lagrangian cut techniques are combined to generate Lipschitz continuous non-convex approximations of the value functions. Those approximations are then used to decide whether the approximating MILP has to be dynamically refined and in order to compute feasible solutions for the original MINLP. We prove that NC-NBD converges to an $$\varepsilon $$ ε -optimal solution in a finite number of steps. We provide promising computational results for some unit commitment problems of moderate size.