Fast Thermal Generation Rescheduling

A new dynamic programming algorithm for fast rescheduling thermal generation is presented. The savings in computational times are brought about by the introduction of two new techniques: the variable truncation dynamic programming and the limitation of the solution space to be searched. Several exam...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on power systems 1987-02, Vol.2 (1), p.65-71
Main Authors: Villaseca, F. Eugenio, Fardanesh, Behruz
Format: Article
Language:English
Subjects:
Applied sciences
Costs
Dynamic programming
Economic forecasting
Electrical engineering. Electrical power engineering
Electrical power engineering
Exact sciences and technology
Heuristic algorithms
Lagrangian functions
Linear programming
Mathematical programming
Operation. Load control. Reliability
Power generation economics
Power networks and lines
Processor scheduling
Thermal engineering
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:A new dynamic programming algorithm for fast rescheduling thermal generation is presented. The savings in computational times are brought about by the introduction of two new techniques: the variable truncation dynamic programming and the limitation of the solution space to be searched. Several examples on a 20 machine system are used to illustrate the application of the algorithm and to show that optimal solutions are obtained at significantly reduced computational times.
ISSN:0885-8950
1558-0679
DOI:10.1109/TPWRS.1987.4335075