Chaotic Iteration Particle Swarm Optimization Algorithm Based on Economic Load Dispatch

摘要

To solve the non-convex and non-linear economic dispatch problem efficiently, a chaotic iteration particle swarm optimization algorithm is presented. In the global research of particle swarm optimization and local optimum, ergodicity of chaos can effectively restrain premature. To balance the exploration and exploitation abilities and avoid being trapped into local optimal, a new index, called iteration best, is incorporated into particle swarm optimization, and chaotic mutation with a new Tent map imported can make local search within the prior knowledge, a new strategy is proposed in iteration strategy. The algorithm is validated for two test systems consisting of 6 and 15 generators. Compared with other methods in this literature, the experimental result demonstrates the high convergency and effectiveness of proposed algorithm.