A new simulated annealing-based tabu search algorithm for unitcommitment

(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
14476_1.pdf

Download (19kB) | Preview
[img] Microsoft Word
14476_2.doc

Download (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
Subjects: Computer
Department: College of Engineering and Physics > Electrical Engineering
Depositing User: Mr. Admin Admin
Date Deposited: 24 Jun 2008 13:37
Last Modified: 01 Nov 2019 14:05
URI: https://eprints.kfupm.edu.sa/id/eprint/14476