We present a novel formulation for startup cost computation in the unit commitment problem (UC). Both the proposed formulation and existing formulations in the literature are placed in a formal, theoretical dominance hierarchy based on their respective linear programming relaxations. The proposed formulation is tested empirically against existing formulations on large-scale unit commitment inst...

This study presents a new formulation based on generalized benders decomposition approach to solve thermal unit commitment problem. This new approach decomposes the problem into a master problem and a sub-problem. The master problem is an integer program and sub-problem is a nonlinear program. The master problem applies the integer programming method to solve (Unit Commitment) UC and finds prop...

This article introduces modern optimization models and solution methods for two fundamental decision making problems in electric power system operations, the optimal power flow (OPF) problem and the unit commitment (UC) problem. The article surveys some of the most recent advances, including global optimization techniques for exact solution of the OPF problem, adaptive robust optimization model...

We present sufficient conditions under which thermal generators can be aggregated in mixed-integer linear programming (MILP) formulations of the unit commitment (UC) problem, while maintaining feasibility and optimality for the original disaggregated problem. Aggregating thermal generators with identical characteristics (e.g., minimum/maximum power output, minimum up/down-time, and cost curves)...

Motivated by applications to secure multiparty computation, we study the complexity of realizing universally composable (UC) commitments. Several recent works obtain practical UC commitment protocols in the common reference string (CRS) model under the DDH assumption. These protocols have two main disadvantages. First, even when applied to long messages, they can only achieve a small constant r...

The solution of the unit commitment problem (UCP) is a complex optimization problem. The exact solution of the UCP can he obtained by a complete enumeration of all feasible combinations of generating units, which could be a huge number. The objective is to find the generation scheduling such that the total operating cost can be minimized, when subjected to a variety of constraints. This also me...

In this paper an application of a combined method for the profit based unit commitment problem (PBUC) using Genetic Algorithm and Lagrangian Relaxation (LR) is presented. The algorithm is proposed to solve PBUC under deregulated environment with the objective of maximizing GENCO’s profit and minimizing the operating cost. The problem formulation of the unit commitment takes into consideration t...

In recent years, metaheuristics have been applied with some success to the Unit Commitment (UC) problem. Methods like Simulated Annealing, Tabu Search and Evolutionary Programming can be found in several papers, presenting results that are sufficiently interesting to justify further research in the area. In this paper, a new metaheuristic approach based on GRASP Greedy Randomized Adaptive Searc...

The increasing concern of global climate changes, the promotion of renewable energy sources, primarily wind generation, is a welcome move to reduce the pollutant emissions from conventional power plants. Integration of wind power generation with the existing power network is an emerging research field. This paper presents a meta-heuristic algorithm based approach to determine the feasible dispa...

This paper presents a new approach for thermal unit commitment (UC) using a differential evolution (DE) algorithm. DE is an effective, robust, and simple global optimization algorithm which only has a few control parameters and has been successfully applied to a wide range of optimization problems. However, the standard DE cannot be applied to binary optimization problems such as UC problems si...