Solve traveling salesman problems based on QPSO
Wenbo Xu · Jisuanji gongcheng yu sheji · 2007
The algorithm of quantum particle swarm optimization(QPSO) is developed to solve traveling salesman problems(TSP).This algorithm increase the speed of convergence instead of the basic algorithm of particle swarm optimization(PSO).Based on the con-cepts of swap operator and swap sequence,TSP is solved as fast as possible with Matlab.The experiments show that the improved QPSO,which is practised to a traveling salesman problem with 14 nodes,can reach the best results quickly and improve the level of searching efficiency.Therefore QPSO will help to solve the problems of combinatorial optimization effectively.