An evolutionary programming based tabu search method for solving the unit commitment problem in utility system

• Published in: 2004 IEEE Region 10 Conference TENCON 2004 Vol. C; pp. 472 - 475 Vol. 3
• Main Author: Rajan, C.C.A.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 2004
• Subjects: Costs; Design optimization; Dynamic programming; Genetic programming; Power generation; Power system dynamics; Power systems; Processor scheduling; Search methods; Utility programs
• ISBN: 0780385608; 9780780385603
• DOI: 10.1109/TENCON.2004.1414810

This paper presents a new approach to solving the short-term unit commitment problem in utility system using an evolutionary programming based tabu search method. 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. The best population is selected by evolutionary strategy. A 66-bus utility power system with twelve generating units in India demonstrates the effectiveness of the proposed approach. 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 and tabu search in reaching proper unit commitment.