Academic Journals Database
Disseminating quality controlled scientific knowledge

Neural Based Tabu Search method for solving unit commitment problem with cooling-banking constraints

ADD TO MY LIST
 
Author(s): Rajan Asir Christober Gnanakkan Charles

Journal: Serbian Journal of Electrical Engineering
ISSN 1451-4869

Volume: 6;
Issue: 1;
Start page: 57;
Date: 2009;
VIEW PDF   PDF DOWNLOAD PDF   Download PDF Original page

Keywords: neural network | Tabu search | unit commitment | cooling-banking

ABSTRACT
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.

Tango Rapperswil
Tango Rapperswil

     Affiliate Program