Dynamic queuing approach to power system short term economic and security dispatch

This paper proposes a novel algorithm to calculate the optimising problem of economic and security dispatch in which DC power flow and limitation on power transmission line capacity are taken into consideration. Compared to the conventional Lagrangian Relaxation approach, the algorithm proposed is more effective in calculating speed, robustness, property of convergence and requirement of computer memory without introducing any multiplier. A new and efficient way is proposed to deal with more complex constraints in economic dispatch. The theoretical proof of the algorithm is also given in this paper and the advantage is demonstrated by calculating the IEEE 24-node system and compared with the results obtained by MATLAB