Particle swarm optimization for Traveling Salesman Problem

被引：263

作者：

Wang, KP ^{[1
]}

Huang, L ^{[1
]}

Zhou, CG ^{[1
]}

Pang, W ^{[1
]}

机构：

[1] Jilin Univ, Coll Comp Sci & Technol, Changchun 130012, Peoples R China

来源：

2003 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-5, PROCEEDINGS | 2003年

关键词：

particle swarm optimization; traveling salesman problem; combinatorial optimization;

D O I：

10.1109/ICMLC.2003.1259748

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

This paper proposes a new application of Particle Swarm Optimization for Traveling Salesman Problem. We have developed some special methods for solving TSP using PSO. We have also proposed the concept of Swap Operator and Swap Sequence, and redefined some operators on the basis of them, in this way the paper has designed a special PSO. The experiments show that it can achieve good results.

引用

页码：1583 / 1585

页数：3