Evolutionary Programming-Based Multiarea Economic Dispatch with Tie Line Constraints

TLDR: In this article, a new approach to include tie line constraints in multi-area economic dispatch problems by using evolutionary programming (EP) was presented, and the proposed method always finds the global or near global optimum for small and reasonable-sized multi-region economic dispatch.

Abstract: This paper presents a new approach to include tie line constraints in multiarea economic dispatch problems by using evolutionary programming (EP). The proposed method always finds the global or near global optimum for small and reasonable-sized multiarea economic dispatch (MAED) problems. The inclusion of tie line constraints to MAED does not introduce any complexity in the approach. The applicability and validity of the proposed method is shown by implementing it on three example systems - 2, 4, and 14 areas - and their results are compared with those obtained by classical economic dispatch, network flow programming, and dynamic programming methods, respectively. The results show that the proposed method can serve as a potential tool for solving MAED problems.