Heuristic information based improved fuzzy discrete PSO method for solving TSP

Authors:
Bin Shen;Min Yao;Wensheng Yi
Affiliations:
College of Computer Science, Zhejiang University, Hangzhou, P.R. China;College of Computer Science, Zhejiang University, Hangzhou, P.R. China;College of Computer Science, Zhejiang University, Hangzhou, P.R. China
Venue:
PRICAI'06 Proceedings of the 9th Pacific Rim international conference on Artificial intelligence
Year:
2006

Citing 1
Cited 3

Fuzzy Discrete Particle Swarm Optimization for Solving Traveling Salesman Problem

CIT '04 Proceedings of the The Fourth International Conference on Computer and Information Technology

A novel set-based particle swarm optimization method for discrete optimization problems

IEEE Transactions on Evolutionary Computation
A rotary chaotic PSO algorithm for trustworthy scheduling of a grid workflow

Computers and Operations Research
A novel cyclic discrete optimization framework for particle swarm optimization

ICIC'10 Proceedings of the 6th international conference on Advanced intelligent computing theories and applications: intelligent computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose an improved fuzzy discrete Particle Swarm Optimization method (IFD-PSO), and apply this method to TSP. We use fuzzy matrix space to represent the corresponding TSP solution, and bring forward the transformation method of fuzzy matrix space. Heuristic information is employed to improve the convergence speed. The experiment results show that IFD-PSO has a better performance and achieves satisfactory effect.