Fuzzy Discrete Particle Swarm Optimization for Solving Travel Salesman Problem

Wei Pang, Kangping Wang, Chunguang Zhou, Lan Huang, Xiaohui Ji

Research output: Contribution to journalArticle

Abstract

Particle Swarm Optimization has succeeded in many continuous problems, but research about discrete problems especially routing problems has been done little. In this paper, an improved Particle Swarm Optimization (PSO) algorithm to solve Traveling Salesman Problem was proposed. Fuzzy Matrix was 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 several concrete examples from TSPLIB, experiment shows that the algorithm can achieve good results.
Original languageChinese
Pages (from-to)1331-1334
JournalJournal of Chinese Computer Systems
Volume26
Issue number8
Publication statusPublished - 2005

Keywords

  • particle
  • swarm
  • optimization
  • traveling salesman problem
  • fuzzy matrix

Cite this

Fuzzy Discrete Particle Swarm Optimization for Solving Travel Salesman Problem. / Pang, Wei; Wang, Kangping; Zhou, Chunguang ; Huang, Lan; Ji, Xiaohui.

In: Journal of Chinese Computer Systems, Vol. 26, No. 8, 2005, p. 1331-1334.

Research output: Contribution to journalArticle

Pang, Wei ; Wang, Kangping ; Zhou, Chunguang ; Huang, Lan ; Ji, Xiaohui. / Fuzzy Discrete Particle Swarm Optimization for Solving Travel Salesman Problem. In: Journal of Chinese Computer Systems. 2005 ; Vol. 26, No. 8. pp. 1331-1334.
@article{f4e1d4b0293b40dfaabd319ec9d89723,
title = "Fuzzy Discrete Particle Swarm Optimization for Solving Travel Salesman Problem",
abstract = "Particle Swarm Optimization has succeeded in many continuous problems, but research about discrete problems especially routing problems has been done little. In this paper, an improved Particle Swarm Optimization (PSO) algorithm to solve Traveling Salesman Problem was proposed. Fuzzy Matrix was 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 several concrete examples from TSPLIB, experiment shows that the algorithm can achieve good results.",
keywords = "particle, swarm, optimization, traveling salesman problem, fuzzy matrix",
author = "Wei Pang and Kangping Wang and Chunguang Zhou and Lan Huang and Xiaohui Ji",
note = "In Chinese with English abstract",
year = "2005",
language = "Chinese",
volume = "26",
pages = "1331--1334",
journal = "Journal of Chinese Computer Systems",
number = "8",

}

TY - JOUR

T1 - Fuzzy Discrete Particle Swarm Optimization for Solving Travel Salesman Problem

AU - Pang, Wei

AU - Wang, Kangping

AU - Zhou, Chunguang

AU - Huang, Lan

AU - Ji, Xiaohui

N1 - In Chinese with English abstract

PY - 2005

Y1 - 2005

N2 - Particle Swarm Optimization has succeeded in many continuous problems, but research about discrete problems especially routing problems has been done little. In this paper, an improved Particle Swarm Optimization (PSO) algorithm to solve Traveling Salesman Problem was proposed. Fuzzy Matrix was 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 several concrete examples from TSPLIB, experiment shows that the algorithm can achieve good results.

AB - Particle Swarm Optimization has succeeded in many continuous problems, but research about discrete problems especially routing problems has been done little. In this paper, an improved Particle Swarm Optimization (PSO) algorithm to solve Traveling Salesman Problem was proposed. Fuzzy Matrix was 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 several concrete examples from TSPLIB, experiment shows that the algorithm can achieve good results.

KW - particle

KW - swarm

KW - optimization

KW - traveling salesman problem

KW - fuzzy matrix

M3 - Article

VL - 26

SP - 1331

EP - 1334

JO - Journal of Chinese Computer Systems

JF - Journal of Chinese Computer Systems

IS - 8

ER -