Abstract
This paper proposes a new tabu search based method for service restoration in distribution systems. The formulation of the service restoration may be expressed as a combinatorial optimization problem for determining a new route with switches to recover the service in an outage area. It aims at minimizing an outage area and equalizing the power source margins in the recovered areas as well as computational efficiency. In this paper, a new method is proposed to integrate parallel tabu search (PTS) with ordinal optimization (OO) in distribution system service restoration. PTS has better performance than TS in terms of solution quality and computational time. OO contributes to the reduction of computational effort in selecting solution candidates in the neighborhood of TS. In other words, it plays an important role to improve computational as a complementary tool efficiently. The proposed method is successfully applied to a 138-node system.
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.
