By Topic

An improved ant colony search algorithm for reconfiguration of distribution network with distributed generations

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

3 Author(s)
Wang Gang ; Dept. of Electr. Eng., Shenyang Inst. of Eng., Shenyang, China ; Liu Li ; Tieyan Zhang

As a global optimization method based on probability, Ant Colony Search (ACS) algorithm is suitable for solving combinatorial optimization problem of Complex system. According to the weakly mesh structure feature of the distribution containing distributed generations (DG), the paper finds the ratio of the capacity of DG, load and the number of ants in the area of distributed generations supply, especially the ratio of DG is “negative”. Considering the constraint condition of voltage, the network of this area is first reconfigured in order to offset the effect of DG. In the end, the traditional ACS algorithm is used to analyze the rest of network. Plenty of simulations with IEEE 33 buses system are carried out to illustrate the performance of the proposed method. Test result verifies the feasibility of the proposed algorithm.

Published in:

Innovative Smart Grid Technologies - Asia (ISGT Asia), 2012 IEEE

Date of Conference:

21-24 May 2012