A Hybrid Algorithm Based on Particle Swarm Optimization and Ant Colony Optimization Algorithm

详细信息    查看全文

• 关键词：Particle swarm optimization ; Ant colony optimization ; Optimal solution
• 刊名：Lecture Notes in Computer Science
• 出版年：2017
• 出版时间：2017
• 年：2017
• 卷：10135
• 期：1
• 页码：22-31
• 丛书名：Smart Computing and Communication
• ISBN：978-3-319-52015-5
• 卷排序：10135

文摘

Particle swarm optimization (PSO) and Ant Colony Optimization (ACO) are two important methods of stochastic global optimization. PSO has fast global search capability with fast initial speed. But when it is close to the optimal solution, its convergence speed is slow and easy to fall into the local optimal solution. ACO can converge to the optimal path through the accumulation and update of the information with the distributed parallel global search ability. But it has slow solving speed for the lack of initial pheromone at the beginning. In this paper, the hybrid algorithm is proposed in order to use the advantages of both of the two algorithm. PSO is first used to search the global solution. When it maybe fall in local one, ACO is used to complete the search for the optimal solution according to the specific conditions. The experimental results show that the hybrid algorithm has achieved the design target with fast and accurate search.