KFUPM ePrints

A new simulated annealing-based tabu search algorithm for unitcommitment

Mantawy, A.H. and Abdel-Magid, Y.L. and Selim, S.Z. (1997) A new simulated annealing-based tabu search algorithm for unitcommitment. Systems, Man, and Cybernetics, 1997. 'Computational Cybernetics and Simulation'., 1997 IEEE International conference, 3.

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

Abstract

We propose a new hybrid algorithm for solving the unit commitment problem (UCP). The algorithm integrates the use of simulated annealing (SA) and tabu search (TS) for solving the UCP. The algorithm includes a step to find an initial control parameter, at which virtually all trial solutions are accepted. It uses a polynomial-time cooling schedule that is advocated in the SA literature. Furthermore, the short-term memory procedures of the TS method are embedded in the SA test to prevent cycling of accepted solutions. Numerical examples from the literature are solved. Results showed an improvement in the solutions costs compared to previously obtained results



Item Type:Article
Date:October 1997
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:14476
Deposited By:KFUPM ePrints Admin
Deposited On:24 Jun 2008 16:37
Last Modified:12 Apr 2011 13:15

Repository Staff Only: item control page