Dynamic Economic Dispatch For Large Scale Power Systems: A Lagrangian Relaxation Approach
The dynamic multi-period economic dispatch problem for large-scale power systems is modelled as a linear programming problem. The model considers loading and deloading rates, limits on generators outputs, spinning reserve requirements and group power import-export limits. The solution algorithm is b...
Saved in:
Main Authors: | , |
---|---|
格式: | Article |
語言: | English |
出版: |
Elsevier
1991
|
主題: | |
在線閱讀: | http://eprints.utem.edu.my/id/eprint/8897/2/P2.pdf http://eprints.utem.edu.my/id/eprint/8897/ https://www.sciencedirect.com/science/article/pii/014206159190018Q https://doi.org/10.1016/0142-0615(91)90018-Q |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
id |
my.utem.eprints.8897 |
---|---|
record_format |
eprints |
spelling |
my.utem.eprints.88972021-09-29T13:07:36Z http://eprints.utem.edu.my/id/eprint/8897/ Dynamic Economic Dispatch For Large Scale Power Systems: A Lagrangian Relaxation Approach Ab Ghani, Mohd Ruddin Hindi, K. S. TK Electrical engineering. Electronics Nuclear engineering The dynamic multi-period economic dispatch problem for large-scale power systems is modelled as a linear programming problem. The model considers loading and deloading rates, limits on generators outputs, spinning reserve requirements and group power import-export limits. The solution algorithm is based on Lagrangian relaxation and on exploiting the intimate relationship between optimizing the dual Lagrangian function and Dantzig-Wolfe decomposition. The relaxation is carried out so that the relaxed problem is decomposable to a number of subproblems corresponding to the periods in the dispatch horizon. These are solved simply by using priority lists. The dual Lagrangian function is optimized using subgradient optization. If an overall solution feasible in all constraints and sufficiently close to a computed best lower bound is discovered during subgradient optimization, it is deemed optimal. Otherwise, Dantzig-Wolfe decomposition is invoked, using almost all the information generated during subgradient optimization to ensure a speedy conclusion. The computational efficiency of the algorithm renders it suitable for on-line dispatch. Elsevier 1991-02 Article PeerReviewed text en http://eprints.utem.edu.my/id/eprint/8897/2/P2.pdf Ab Ghani, Mohd Ruddin and Hindi, K. S. (1991) Dynamic Economic Dispatch For Large Scale Power Systems: A Lagrangian Relaxation Approach. International Journal of Electrcal Power & Energy Systems, 13 (1). 51 -56. ISSN 0142-0615/91/010051-06 https://www.sciencedirect.com/science/article/pii/014206159190018Q https://doi.org/10.1016/0142-0615(91)90018-Q |
institution |
Universiti Teknikal Malaysia Melaka |
building |
UTEM Library |
collection |
Institutional Repository |
continent |
Asia |
country |
Malaysia |
content_provider |
Universiti Teknikal Malaysia Melaka |
content_source |
UTEM Institutional Repository |
url_provider |
http://eprints.utem.edu.my/ |
language |
English |
topic |
TK Electrical engineering. Electronics Nuclear engineering |
spellingShingle |
TK Electrical engineering. Electronics Nuclear engineering Ab Ghani, Mohd Ruddin Hindi, K. S. Dynamic Economic Dispatch For Large Scale Power Systems: A Lagrangian Relaxation Approach |
description |
The dynamic multi-period economic dispatch problem for large-scale power systems is modelled as a linear programming problem. The model considers loading and deloading rates, limits on generators outputs, spinning reserve requirements and group power import-export limits. The solution algorithm is based on Lagrangian relaxation and on exploiting the intimate relationship between optimizing the dual Lagrangian function and Dantzig-Wolfe decomposition. The relaxation is carried out so that the relaxed problem is decomposable to a number of subproblems corresponding to the periods in the dispatch horizon. These are solved simply by using priority lists. The dual Lagrangian function is optimized using subgradient optization. If an overall solution feasible in all constraints and sufficiently close to a computed best lower bound is discovered during subgradient optimization, it is deemed optimal. Otherwise, Dantzig-Wolfe decomposition is invoked, using almost all the information generated during subgradient optimization to ensure a speedy conclusion. The computational efficiency of the algorithm renders it suitable for on-line dispatch. |
format |
Article |
author |
Ab Ghani, Mohd Ruddin Hindi, K. S. |
author_facet |
Ab Ghani, Mohd Ruddin Hindi, K. S. |
author_sort |
Ab Ghani, Mohd Ruddin |
title |
Dynamic Economic Dispatch For Large Scale Power Systems: A Lagrangian Relaxation Approach |
title_short |
Dynamic Economic Dispatch For Large Scale Power Systems: A Lagrangian Relaxation Approach |
title_full |
Dynamic Economic Dispatch For Large Scale Power Systems: A Lagrangian Relaxation Approach |
title_fullStr |
Dynamic Economic Dispatch For Large Scale Power Systems: A Lagrangian Relaxation Approach |
title_full_unstemmed |
Dynamic Economic Dispatch For Large Scale Power Systems: A Lagrangian Relaxation Approach |
title_sort |
dynamic economic dispatch for large scale power systems: a lagrangian relaxation approach |
publisher |
Elsevier |
publishDate |
1991 |
url |
http://eprints.utem.edu.my/id/eprint/8897/2/P2.pdf http://eprints.utem.edu.my/id/eprint/8897/ https://www.sciencedirect.com/science/article/pii/014206159190018Q https://doi.org/10.1016/0142-0615(91)90018-Q |
_version_ |
1713203437545455616 |
score |
13.250246 |