Chaotic Particle Swarm Optimization Algorithm for Traveling Salesman Problem

摘要：

In this paper, a novel algorithm based on particle optimization algorithm (PSO) and chaos optimization algorithm (COA) is presented to solve traveling salesman problem. Some new operators are proposed to overcome the difficulties of implementing PSO into solving the discreet problems. Meanwhile embedded with chaos optimization algorithm (COA) it can enhance particle’s global searching ability so as not to converge to the local optimal solutions too quickly. The experiment results of several benchmark test problems show its validity and satisfactory effect.

关键词： Particle swarm optimization (PSO) Chaos optimization algorithm (COA) Traveling Salesman Problem (TSP) Position swap

作者: Zhenglei Yuan Liliang Yang Yaohua Wu Li Liao Guoqiang Li

作者单位: The Logistics Institute Shandong University Jinan, Shandong Province, China

会议类型: 国际会议

会议名称: 2007 IEEE International Conference on Automation and Lofistics

会议地点: 山东济南

会议语种:英文

在线出版日期: 2007-08-18（万方平台首次上网日期，不代表论文的发表时间）