By Topic

A new method for snapshot and time-varying distribution network reconfiguration

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

2 Author(s)
Jianzhong Wu ; Dept. of Electr. Eng., Tianjin Univ., China ; Yixin Yu

A global optimization method is presented for solving the snapshot and time-varying reconfiguration problems for large-scale electric power distribution networks. The snapshot reconfiguration problem using one single snapshot of the network loading condition is solved by two steps: first, search for the local optimums by Dijkstra's shortest-path algorithm, and form core schema chromosomes by core schema algorithm; second, search possible core schema chromosomes for the global optimums by employing genetic algorithm. The time-varying reconfiguration problem, which utilizes varying, loading conditions during each given time interval, is solved as a series of snapshot problems based on dynamic programming. The proposed method can be used as an efficient tool for distribution network planning, on-line dispatching, and off-line analysis.

Published in:

Intelligent Control and Automation, 2004. WCICA 2004. Fifth World Congress on  (Volume:6 )

Date of Conference:

15-19 June 2004