Abstract
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.
| Original language | American English |
|---|---|
| Journal | IEEE Transactions on Power Systems |
| Volume | 2 |
| DOIs | |
| State | Published - Feb 1 1987 |
Keywords
- Costs
- Dynamic programming
- Economic forecasting
- Heuristic algorithms
- Lagrangian functions
- Linear programming
- Mathematical programming
- Power generation economics
- Processor scheduling
- Thermal engineering
Disciplines
- Electrical and Computer Engineering
- Power and Energy
Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS