Particle swarm optimization for traveling salesman problem

Kangping Wang; Lan Huang; Chunguang  Zhou; Wei Pang

doi:10.1109/ICMLC.2003.1259748

Particle swarm optimization for traveling salesman problem

Kangping Wang, Lan Huang, Chunguang Zhou, Wei Pang

Computing Science

Research output: Chapter in Book/Report/Conference proceeding › Published conference contribution

388 Citations (Scopus)

Abstract

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.

Original language	English
Title of host publication	2003 International Conference on Machine Learning and Cybernetics
Publisher	IEEE Press
Pages	1583-1585
Number of pages	3
Volume	3
DOIs	https://doi.org/10.1109/ICMLC.2003.1259748
Publication status	Published - 2 Nov 2003

Access to Document

10.1109/ICMLC.2003.1259748

Cite this

@inproceedings{3c672b46defb448783e8a8018da6ca8c,

title = "Particle swarm optimization for traveling salesman problem",

abstract = "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. ",

author = "Kangping Wang and Lan Huang and Chunguang Zhou and Wei Pang",

year = "2003",

month = nov,

day = "2",

doi = "10.1109/ICMLC.2003.1259748",

language = "English",

volume = "3",

pages = "1583--1585",

booktitle = "2003 International Conference on Machine Learning and Cybernetics",

publisher = "IEEE Press",

}

TY - GEN

T1 - Particle swarm optimization for traveling salesman problem

AU - Wang, Kangping

AU - Huang, Lan

AU - Zhou, Chunguang

AU - Pang, Wei

PY - 2003/11/2

Y1 - 2003/11/2

N2 - 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.

AB - 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.

U2 - 10.1109/ICMLC.2003.1259748

DO - 10.1109/ICMLC.2003.1259748

M3 - Published conference contribution

VL - 3

SP - 1583

EP - 1585

BT - 2003 International Conference on Machine Learning and Cybernetics

PB - IEEE Press

ER -

Particle swarm optimization for traveling salesman problem

Abstract

Access to Document

Fingerprint

Cite this