Abstract
In order to avoid the premature convergence and improve convergence rate, a novel adaptive genetic algorithm for reactive power optimization is discussed in detail. In reproduction operator, the method of retaining optimal individual is used to ensure the convergence and at the same time, the competition method is also adopted to keep the better dispersal of all individuals. In Mutation operator, the mutation probability P <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m</sub> is improved based on adaptive genetic algorithm. When fitness of individuals in the population tends to be identical, P <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m</sub> can be adjusted to make bigger, and the local convergence can be avoided greatly. The algorithm has been applied to IEEE 30-bus testing system .The test shows that this algorithm is feasible and practical.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
