A simulated annealing algorithm for unit commitment
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...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , , |
| Format: | article |
| Published: |
1998
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/14357/1/14357_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14357/2/14357_2.doc |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|