By Topic

An improved minimum-cost spanning tree for optimal planning of distribution networks

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

5 Author(s)
Liu Jian ; Xi''an Univ. of Technol., China ; Yang Wenyu ; Yu Jianming ; Song Meng
more authors

An improved minimum-cost spanning tree algorithm (MCST) for optimal planning of distribution network is put forward. The proposed method is based on Kruskal algorithm with improvements such as the shortest paths between each two load points are regarded as the candidate paths, and that once a path is determined, the connection nodes on it are turned into load points. Consequently, the conventional MCST's shortcoming of not able to handle the connection nodes on paths is over come. Further more, the proposed method is extended into meshed network planning by determining the shortest routes between each source point before hand and then executing the improved MCST under the condition of no more loops being formed. The way to modify the size of the cross section of conducting wires for looped routes, trunk routes and branches are dealt with. Further optimization to obtain less losses and voltage drops are also discussed. The feasibility of the proposed method is shown by a practical example.

Published in:

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

Date of Conference:

15-19 June 2004