By Topic

A parallel tabu search based approach to optimal network reconfigurations for service restoration in 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
$33 $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

2 Author(s)
H. Mori ; Dept. of Electr. & Electron. Eng, Meiji Univ., Kawasaki, Japan ; Y. Ogita

This paper proposes a new method for optimizing the network reconfigurations for service restoration in distribution systems. The service restoration may be expressed in a complicated combinatorial optimization problem. In this paper, meta-heuristics are considered to solve the problem efficiently. The proposed method makes use of parallel tabu search (PTS) that considers a couple of strategies in tabu search (TS). One strategy is to decompose the neighborhood into subneighborhoods to reduce computational effort. The other is to introduce several tabu lengths into TS to make solution candidates more diverse. The proposed method is applied to the 69-node distribution systems. A comparison is made between the conventional and the proposed methods in terms of computational effort and solution accuracy.

Published in:

Control Applications, 2002. Proceedings of the 2002 International Conference on  (Volume:2 )

Date of Conference: