Fuzzy discrete particle swarm optimization for solving traveling salesman problem

Wei Pang, Kangping Wang, Chunguang Zhou, Longjiang Dong, Zhikang Yin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

108 Citations (Scopus)

Abstract

Particle swarm optimization, as an evolutionary computing technique, has succeeded in many continuous problems, but research on discrete problems especially combinatorial optimization problem has been done little according to Kennedy and Eberhart (1997) and Mohan and Al-kazemi (2001). In this paper, a modified particle swarm optimization (PSO) algorithm was proposed to solve a typical combinatorial optimization problem: traveling salesman problem (TSP), which is a well-known NP-hard problem. Fuzzy matrices were used to represent the position and velocity of the particles in PSO and the operators in the original PSO formulas were redefined. Then the algorithm was tested with concrete examples in TSPLIB, experiment shows that the algorithm can achieve good results.
Original languageEnglish
Title of host publicationProceedings of the 2004 International Conference on Computer and Information Technology (CIT2004)
Place of PublicationLos Alamos, CA, USA
PublisherIEEE Press
Pages796-800
Number of pages5
ISBN (Print)0769522165
DOIs
Publication statusPublished - 30 Nov 2004
Event4th International Conference on Computer and Information Technology (CIT2004) - Wuhan, China
Duration: 14 Sep 200416 Sep 2004

Conference

Conference4th International Conference on Computer and Information Technology (CIT2004)
CountryChina
CityWuhan
Period14/09/0416/09/04

Fingerprint

Traveling salesman problem
Particle swarm optimization (PSO)
Combinatorial optimization
Mathematical operators
Computational complexity
Experiments

Keywords

  • fuzzy set theory
  • NP-hard problem
  • particle swarm optimization
  • random number generation
  • testing
  • traveling salesman problem
  • evolutionary computation
  • cities and towns
  • educational institutions
  • matrix algebra

Cite this

Pang, W., Wang, K., Zhou, C., Dong, L., & Yin, Z. (2004). Fuzzy discrete particle swarm optimization for solving traveling salesman problem. In Proceedings of the 2004 International Conference on Computer and Information Technology (CIT2004) (pp. 796-800). Los Alamos, CA, USA: IEEE Press. https://doi.org/10.1109/CIT.2004.1357292

Fuzzy discrete particle swarm optimization for solving traveling salesman problem. / Pang, Wei; Wang, Kangping; Zhou, Chunguang ; Dong, Longjiang; Yin, Zhikang.

Proceedings of the 2004 International Conference on Computer and Information Technology (CIT2004). Los Alamos, CA, USA : IEEE Press, 2004. p. 796-800.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Pang, W, Wang, K, Zhou, C, Dong, L & Yin, Z 2004, Fuzzy discrete particle swarm optimization for solving traveling salesman problem. in Proceedings of the 2004 International Conference on Computer and Information Technology (CIT2004). IEEE Press, Los Alamos, CA, USA, pp. 796-800, 4th International Conference on Computer and Information Technology (CIT2004), Wuhan, China, 14/09/04. https://doi.org/10.1109/CIT.2004.1357292
Pang W, Wang K, Zhou C, Dong L, Yin Z. Fuzzy discrete particle swarm optimization for solving traveling salesman problem. In Proceedings of the 2004 International Conference on Computer and Information Technology (CIT2004). Los Alamos, CA, USA: IEEE Press. 2004. p. 796-800 https://doi.org/10.1109/CIT.2004.1357292
Pang, Wei ; Wang, Kangping ; Zhou, Chunguang ; Dong, Longjiang ; Yin, Zhikang. / Fuzzy discrete particle swarm optimization for solving traveling salesman problem. Proceedings of the 2004 International Conference on Computer and Information Technology (CIT2004). Los Alamos, CA, USA : IEEE Press, 2004. pp. 796-800
@inproceedings{81d53bbac2f246eb99dfe9737528bc32,
title = "Fuzzy discrete particle swarm optimization for solving traveling salesman problem",
abstract = "Particle swarm optimization, as an evolutionary computing technique, has succeeded in many continuous problems, but research on discrete problems especially combinatorial optimization problem has been done little according to Kennedy and Eberhart (1997) and Mohan and Al-kazemi (2001). In this paper, a modified particle swarm optimization (PSO) algorithm was proposed to solve a typical combinatorial optimization problem: traveling salesman problem (TSP), which is a well-known NP-hard problem. Fuzzy matrices were used to represent the position and velocity of the particles in PSO and the operators in the original PSO formulas were redefined. Then the algorithm was tested with concrete examples in TSPLIB, experiment shows that the algorithm can achieve good results.",
keywords = "fuzzy set theory, NP-hard problem, particle swarm optimization, random number generation, testing, traveling salesman problem, evolutionary computation, cities and towns, educational institutions, matrix algebra",
author = "Wei Pang and Kangping Wang and Chunguang Zhou and Longjiang Dong and Zhikang Yin",
year = "2004",
month = "11",
day = "30",
doi = "10.1109/CIT.2004.1357292",
language = "English",
isbn = "0769522165",
pages = "796--800",
booktitle = "Proceedings of the 2004 International Conference on Computer and Information Technology (CIT2004)",
publisher = "IEEE Press",

}

TY - GEN

T1 - Fuzzy discrete particle swarm optimization for solving traveling salesman problem

AU - Pang, Wei

AU - Wang, Kangping

AU - Zhou, Chunguang

AU - Dong, Longjiang

AU - Yin, Zhikang

PY - 2004/11/30

Y1 - 2004/11/30

N2 - Particle swarm optimization, as an evolutionary computing technique, has succeeded in many continuous problems, but research on discrete problems especially combinatorial optimization problem has been done little according to Kennedy and Eberhart (1997) and Mohan and Al-kazemi (2001). In this paper, a modified particle swarm optimization (PSO) algorithm was proposed to solve a typical combinatorial optimization problem: traveling salesman problem (TSP), which is a well-known NP-hard problem. Fuzzy matrices were used to represent the position and velocity of the particles in PSO and the operators in the original PSO formulas were redefined. Then the algorithm was tested with concrete examples in TSPLIB, experiment shows that the algorithm can achieve good results.

AB - Particle swarm optimization, as an evolutionary computing technique, has succeeded in many continuous problems, but research on discrete problems especially combinatorial optimization problem has been done little according to Kennedy and Eberhart (1997) and Mohan and Al-kazemi (2001). In this paper, a modified particle swarm optimization (PSO) algorithm was proposed to solve a typical combinatorial optimization problem: traveling salesman problem (TSP), which is a well-known NP-hard problem. Fuzzy matrices were used to represent the position and velocity of the particles in PSO and the operators in the original PSO formulas were redefined. Then the algorithm was tested with concrete examples in TSPLIB, experiment shows that the algorithm can achieve good results.

KW - fuzzy set theory

KW - NP-hard problem

KW - particle swarm optimization

KW - random number generation

KW - testing

KW - traveling salesman problem

KW - evolutionary computation

KW - cities and towns

KW - educational institutions

KW - matrix algebra

U2 - 10.1109/CIT.2004.1357292

DO - 10.1109/CIT.2004.1357292

M3 - Conference contribution

SN - 0769522165

SP - 796

EP - 800

BT - Proceedings of the 2004 International Conference on Computer and Information Technology (CIT2004)

PB - IEEE Press

CY - Los Alamos, CA, USA

ER -