Integrating genetic algorithms, tabu search, and simulatedannealing for the unit commitment problem

(1999) Integrating genetic algorithms, tabu search, and simulatedannealing for the unit commitment problem. Power Systems, IEEE Transactions on, 14.

[img]
Preview
PDF
14615_1.pdf

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

Download (27kB)

Abstract

This paper presents a new algorithm based on integrating genetic algorithms, tabu search and simulated annealing methods to solve the unit commitment problem. The core of the proposed algorithm is based on genetic algorithms. Tabu search is used to generate new population members in the reproduction phase of the genetic algorithm. A simulated annealing method is used to accelerate the convergence of the genetic algorithm by applying the simulated annealing test for all the population members. A new implementation of the genetic algorithm is introduced. The genetic algorithm solution is coded as a mix between binary and decimal representation. The fitness function is constructed from the total operating cost of the generating units without penalty terms. In the tabu search part of the proposed algorithm, a simple short-term memory procedure is used to counter the danger of entrapment at a local optimum, and the premature convergence of the genetic algorithm. A simple cooling schedule has been implemented to apply the simulated annealing test in the algorithm. Numerical results showed the superiority of the solutions obtained compared to genetic algorithms, tabu search and simulated annealing methods, and to two exact algorithms

Item Type: Article
Subjects: Computer
Department: College of Engineering and Physics > Electrical Engineering
Depositing User: Mr. Admin Admin
Date Deposited: 24 Jun 2008 13:42
Last Modified: 01 Nov 2019 14:06
URI: https://eprints.kfupm.edu.sa/id/eprint/14615