An evolutionary programming based tabu search method for unit commitment problem with cooling-banking constraints

摘要

This paper presents a new approach to solve the short-term unit commitment problem using an evolutionary programming based tabu search method with cooling and banking constraints. The objective of this paper is to find the generation scheduling such that the total operating cost can be minimized, when subjected to a variety of constraints. This also means that it is desirable to find the optimal generating unit commitment in the power system for the next H hours. Evolutionary programming, which happens to be a global optimization technique for solving unit commitment problem, operates on a system, which is designed to encode each unit's operating schedule with regard to its minimum up/down time. In this, the unit commitment schedule is coded as a string of symbols. An initial population of parent solutions is generated at random. Here, each schedule is formed by committing all the units according to their initial status ("flat start"). Here the parents are obtained from a pre-defined set of solutions, i.e. each and every solution is adjusted to meet the requirements. Then, a random decommitment is carried out with respect to the unit's minimum down times. And TS improves the status by avoiding entrapment in local minima. The best population is selected by evolutionary strategy. Numerical results are shown comparing the cost solutions and computation time obtained by using the evolutionary programming method and other conventional methods like dynamic programming, Lagrangian relaxation.