A simulated annealing algorithm for unit commitment

(1998) A simulated annealing algorithm for unit commitment. Power Systems, IEEE Transactions on, 13.


Download (18kB) | Preview
[img] Microsoft Word

Download (26kB)


This paper presents a simulated annealing algorithm (SAA) to solve the unit commitment problem (UCP). New rules for randomly generating feasible solutions are introduced. The problem has two subproblems: a combinatorial optimization problem; and a nonlinear programming problem. The former is solved using the SAA while the latter problem is solved via a quadratic programming routine. Numerical 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:33
Last Modified: 01 Nov 2019 14:05
URI: https://eprints.kfupm.edu.sa/id/eprint/14357