Robust Algorithm For Economic Dispatch Of Interconnected Systems

This paper presents an efficient and reliable algorithm for solving an economic load dispatch problem of interconnected systems. The proposed algorithm is a feasible type decomposition method in which tie-line flows are coupling variables. Since mathematical programming techniques underlie the proposed algorithm, the decomposition method is robust whereas previously existing algorithms for the problem above are not. In the proposed algorithm, information transmitted through communication channels is reduced for the purpose of computational efficiency. Since the proposed algorithm is a feasible method, a feasible solution is obtained at each coordinating iteration and, the algorithm can be terminated prior to optimality, if desired. Numerical test has been carried out for a real interconnected system composed of six systems. The test result shows the effectiveness of the proposed algorithm.