By Topic

Particle Clonal Genetic Algorithm Using Sequence Coding for Solving 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

3 Author(s)
Yemei Qin ; Sch. of Inf. Sci. & Eng., Central South Univ., Changsha ; Ji Wang ; Weihua Gui

To handle massive binary-coding infeasible solutions in distribution network reconfiguration, a sequence coding is presented. A loop is a gene and the switch sequence in the loop is the gene value. To resolve mutation probability and slow later-period convergence in clonal genetic algorithm(CGA), particle clonal genetic algorithm(PCGA) is proposed. It builds particle swarm algorithm (PSO) mutation operator, and makes up premature convergence of PSO and blindness of CGA. It ensures evolution direction and range based on historical records and swarm records. Global optimal solution is found with fewer generations and shorter searching time. IEEE69 example shows that the method can save calculation time and promote search efficiency obviously.

Published in:

Young Computer Scientists, 2008. ICYCS 2008. The 9th International Conference for

Date of Conference:

18-21 Nov. 2008