Cart (Loading....) | Create Account
Close category search window
 

An ACO algorithm for service restoration in power distribution systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Watanabe, I. ; Syst. Eng. Res. Lab., Central Res. Inst. of Electr. Power Ind., Tokyo, Japan

Service restoration in power distribution systems involves operating the line switches to restore as many loads as possible for the areas isolated by a fault. In service restoration, not only the final network configuration but also the sequence of switching operations is important. This paper proposes an ant colony optimization algorithm for a minimization problem of energy not supplied (ENS) during restoration process. The proposed algorithm based on a hypercube framework (HC-ACO) searches for an optimal switching sequence, and the solution provides an effective service restoration strategy that improves system reliability. The numerical results with a test power system demonstrate the performance of the proposed algorithm.

Published in:

Evolutionary Computation, 2005. The 2005 IEEE Congress on  (Volume:3 )

Date of Conference:

2-5 Sept. 2005

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.