KFUPM ePrints

Unit commitment by tabu search

Mantawy, A.H. and Abdel-Magid, Y.L. and Selim, S.Z. (1998) Unit commitment by tabu search. Generation, Transmission and Distribution, IEE Proceedings-, 145.

[img]
Preview
PDF
18Kb
[img]Microsoft Word
26Kb

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



Item Type:Article
Date:January 1998
Date Type:Publication
Subjects:Computer
Divisions:College Of Engineering Sciences > Electrical Engineering Dept
Creators:Mantawy, A.H. and Abdel-Magid, Y.L. and Selim, S.Z.
ID Code:14580
Deposited By:KFUPM ePrints Admin
Deposited On:24 Jun 2008 16:41
Last Modified:12 Apr 2011 13:17

Repository Staff Only: item control page