Global optimal solution for network reconfiguration problem using AMPSO algorithm

摘要

This paper presents a new Adaptive Mutation Particle Swarm Optimization algorithm for minimization of losses of a Reconfigured Distribution Network. The tendency of solution being struck up to local optima or premature convergence as in the case of conventional PSO is thoroughly avoided using this new proposed technique. The algorithm is based on variance of population's fitness. During running time, the mutation probability is mainly based on variance of population's fitness and current optimal solution. The algorithm is tested on a standard IEEE 16 and 32 bus systems. The simulation results obtained and comparison with other popular existing methods is proving the effectiveness of this method.