A parallel HAD-textured algorithm for constrained economic dispatch control problems

In our earlier papers we 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, we 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