Mantawy, A.H. and Abdel-Magid, Y.L. and Selim, S.Z. (1998) A simulated annealing algorithm for unit commitment. Power Systems, IEEE Transactions on, 13.
![[img]](http://eprints.kfupm.edu.sa/style/images/fileicons/application_pdf.png)
| PDF 17Kb | |
![[img]](http://eprints.kfupm.edu.sa/style/images/fileicons/application_msword.png) | Microsoft Word 25Kb |
Abstract
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 |
|---|---|
| Date: | February 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: | 14357 |
| Deposited By: | KFUPM ePrints Admin |
| Deposited On: | 24 Jun 2008 16:33 |
| Last Modified: | 12 Apr 2011 13:15 |
Repository Staff Only: item control page