Solving Combinatorial Optimization Problem Using Quantum-Behaved Particle Swarm Optimization

摘要：

There are many combinatorial optimization problems for which there exists no direct or efficient method of solution. In this paper, we proposed a novel algorithm called Quantum-Behaved Particle Swarm Optimization (QPSO) that bases rank for solving combinatorial optimization. The experimental results show that it can achieve good results.

关键词： Quantum-Behaved Particle Swarm Optimization Traveling Salesman Problem Combinatorial Optimization

作者: Na Tian Jun Sun Wenbo Xu

作者单位: School of Information Technology, Southern Yangtze University, No.1800, Lihudadao Road, Wuxi, Jiangsu 214122, China

会议类型: 国际会议

会议名称: 2006 International Symposium on Distributed Computing and Applications to Business,Engineering and Science(2006年国际电子、工程及科学领域的分布式计算应用学术研讨会)

会议地点: 杭州

会议语种:英文

页码: 491-493

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