Open AccessNeural Based Tabu Search method for solving unit commitment problem with cooling-banking constraints
Author(s) -
Charles Gnanakkan,
Asir Rajan
Publication year - 2009
Publication title -
serbian journal of electrical engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.133
H-Index - 5
eISSN - 2217-7183
pISSN - 1451-4869
DOI - 10.2298/sjee0901057r
Subject(s) - tabu search , power system simulation , lagrangian relaxation , mathematical optimization , computer science , unit (ring theory) , scheduling (production processes) , relaxation (psychology) , operating cost , power (physics) , job shop scheduling , economic dispatch , electric power system , schedule , mathematics , engineering , psychology , social psychology , physics , mathematics education , quantum mechanics , operating system , waste management
This paper presents a new approach to solve short-term unit commitment problem (UCP) using Neural Based Tabu Search (NBTS) 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 next H hours. A 7-unit utility power system in India demonstrates the effectiveness of the proposed approach; extensive studies have also been performed for different IEEE test systems consist of 10, 26 and 34 units. Numerical results are shown to compare the superiority of the cost solutions obtained using the Tabu Search (TS) method, Dynamic Programming (DP) and Lagrangian Relaxation (LR) methods in reaching proper unit commitment