作者: Xie Zhi
DOI:
关键词: Mathematical optimization 、 Algorithm 、 Multi-swarm optimization 、 Local optimum 、 Local search (optimization) 、 Metaheuristic 、 Chaotic 、 Particle swarm optimization 、 Robustness (computer science) 、 Genetic algorithm 、 Mathematics
摘要: An advanced particle swarm optimization algorithm is presented to enhance the local searching ability. Some particles trapped in minimums are initialized again by chaotic series order introduce neighboring regions of iteration and help them break away from optimum find globe optimal solution rapidly. The experimental results classic functions show that improved hybrid method makes use ergodicity search improve capability precise keep balance between global search, maintain concise calculation (PSO)property. enhanced has great advantage convergence property robustness compared genetic PSO algorithm.