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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on power systems 1998-02, Vol.13 (1), p.197-204
Main Authors: Mantawy, A.H., Abdel-Magid, Y.L., Selim, S.Z.
Format: Article
Language:English
Subjects:
Applied sciences
Cost function
Electrical engineering. Electrical power engineering
Electrical power engineering
Exact sciences and technology
Fuel economy
Operation. Load control. Reliability
Optimization methods
Power generation
Power generation economics
Power networks and lines
Power system dynamics
Power system simulation
Power systems
Quadratic programming
Simulated annealing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0885-8950
1558-0679
DOI:10.1109/59.651636