DocumentCode
1299457
Title
Unit commitment by tabu search
Author
Mantawy, A.H. ; Abdel-Magid, Y.L. ; Selim, S.Z.
Author_Institution
Dept. of Electr. Eng., King Fahd Univ. of Pet. & Miner., Dhahran, Saudi Arabia
Volume
145
Issue
1
fYear
1998
fDate
1/1/1998 12:00:00 AM
Firstpage
56
Lastpage
64
Abstract
An application of the tabu search (TS) method to solve the unit commitment problem (UCP) is presented. The TS seeks to counter the danger of entrapment at a local optimum by incorporating a memory structure that forbids or penalises certain moves that would return to recently visited solutions. New rules for randomly generating feasible solutions for the UCP are introduced. The problem is divided into two subproblems: a combinatorial optimisation problem and a nonlinear programming problem. The former is solved using the tabu search algorithm (TSA) while the latter problem is solved via a quadratic programming routine. Numerical results show an improvement in the solution cost compared to previously obtained results
Keywords
power system planning; combinatorial optimisation problem; nonlinear programming problem; power system unit commitment; quadratic programming routine; tabu search algorithm;
fLanguage
English
Journal_Title
Generation, Transmission and Distribution, IEE Proceedings-
Publisher
iet
ISSN
1350-2360
Type
jour
DOI
10.1049/ip-gtd:19981681
Filename
654424
Link To Document