Comparative Solution of Unit Commitment Problem Using Three Different Methods

Abstract

In this paper, unit commitment problem which is an important subject in power system optimization, is solved by using dynamic programming, Lagrange relaxation, and simulated annealing methods. Dynamic programming method evaluates possible unit commitment schedules associated with decision made in the proceeding step by considering all constraints before searching for a schedule that yields the minimum cost. Lagrangian relaxation method, which is based on mathematical optimization, presents a solution for unit commitment problem. Simulated annealing is a method which refers to the process of heating up a solid to a high temperature followed by slow cooling achieved by decreasing the temperature of the environment in steps and gives feasible solutions for optimization problems. In the simulations made by using MATLAB (R), the operation conditions and total costs of the units are found by using three different solving methods. The solutions are given in the tables and methods used are compared. Four-unit in Tuncbilek thermal plant which is in Kutahya region, Turkey, are used as an example for the unit commitment problem. The data used in this paper is taken from (TEPC) Turkish Electric Power Company and (EGC) Electricity Generation Company.