A parallel HAD-textured algorithm for constrained economic dispatch control problems
- Texas A and M Univ., College Station, TX (United States). Dept. of Electrical Engineering
In the authors` earlier papers, they developed a parallel textured algorithm to solve the constrained economic dispatch control (CEDC) problems. The exact convergence theorem and its proof were provided to guarantee the convergence of the algorithm to the true solution; and some examples were given to show the impact of exact convergence conditions. In this paper, the authors incorporate the hierarchical aggregation-disaggregation (HAD) concept and the textured concept to solve the CEDC. The algorithm is then implemented on an nCUBE2 machine and tested on a modified IEEE 14-bus system, a modified IEEE 57-bus system, a 114-bus system, and a 228-bus system. Some test results are given to show the speedup advantage of the proposed algorithm over the one without textured decomposition. Even when the proposed algorithm is executed sequentially, the speedup is still essential.
- OSTI ID:
- 163056
- Report Number(s):
- CONF-950103--
- Journal Information:
- IEEE Transactions on Power Systems, Journal Name: IEEE Transactions on Power Systems Journal Issue: 3 Vol. 10; ISSN 0885-8950; ISSN ITPSEG
- Country of Publication:
- United States
- Language:
- English
Similar Records
Dispatchability Maximization for Co-Optimized Energy and Reserve Dispatch With Explicit Reliability Guarantee
A tutorial description of an interior point method and its applications to security-constrained economic dispatch