关键词: 粒子群优化算法, Tent 映射, 自适应, 混沌搜索

Abstract: To solve the premature convergence problem of Particle Swarm Optimization (PSO), a new PSO algorithm based on adaptive chaos search was proposed. The uniform particles were produced by Tent mapping so as to improve the quality of the initial solutions. Tent chaotic sequence based an optimal location was produced, and the adaptive adjustment of search scopes can avoid the redundant computation and accelerate the convergence speed of the evolutionary process. The experimental results show that the new introduced algorithm outperforms several other famous improved PSO algorithms on many well-known benchmark problems.

Key words: Particle Swarm Optimization (PSO) algorithm, Tent mapping, adaptive, chaos search