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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
