Fuzzy Discrete Particle Swarm Optimization for Solving Traveling Salesman Problem

Authors:
Wei Pang;Kang-ping Wang;Chun-guang Zhou;Long-jiang Dong
Affiliations:
Jilin University;Jilin University;Jilin University;Jilin University
Venue:
CIT '04 Proceedings of the The Fourth International Conference on Computer and Information Technology
Year:
2004

Citing 0
Cited 19

PSO-based algorithm for home care worker scheduling in the UK

Computers and Industrial Engineering
Application of Multi-objective Particle Swarm Optimization Algorithm in Integrated Marketing Method Selection

ISNN 2009 Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II
Heuristic information based improved fuzzy discrete PSO method for solving TSP

PRICAI'06 Proceedings of the 9th Pacific Rim international conference on Artificial intelligence
Hybrid particle swarm optimisation with k-centres method and dynamic velocity range setting for travelling salesman problems

International Journal of Bio-Inspired Computation
A novel set-based particle swarm optimization method for discrete optimization problems

IEEE Transactions on Evolutionary Computation
Scheduling jobs on computational grids using a fuzzy particle swarm optimization algorithm

Future Generation Computer Systems
Fuzzy C-means and fuzzy swarm for fuzzy clustering problem

Expert Systems with Applications: An International Journal
Communication latency tolerant parallel algorithm for particle swarm optimization

Parallel Computing
Discrete and continuous aspects of nature inspired methods

KES'06 Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part II
Scheduling jobs on computational grids using fuzzy particle swarm algorithm

KES'06 Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part II
PSO and ACO in optimization problems

IDEAL'06 Proceedings of the 7th international conference on Intelligent Data Engineering and Automated Learning
Evaluation of vehicle routing problem with time windows by using metaheuristics algorithm

ACC'11/MMACTEE'11 Proceedings of the 13th IASME/WSEAS international conference on Mathematical Methods and Computational Techniques in Electrical Engineering conference on Applied Computing
Data clustering using modified fuzzy-PSO (MFPSO)

MIWAI'11 Proceedings of the 5th international conference on Multi-Disciplinary Trends in Artificial Intelligence
Evolutionary algorithm to traveling salesman problems

Computers & Mathematics with Applications
New Hybrid Discrete PSO for Solving Non Convex Trim Loss Problem

International Journal of Applied Evolutionary Computation
A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery

Computers and Industrial Engineering
Improved spatial fuzzy c-means clustering for image segmentation using PSO initialization, Mahalanobis distance and post-segmentation correction

Digital Signal Processing
Multi-objective mobile app recommendation: A system-level collaboration approach

Computers and Electrical Engineering
Distributed Query Plan Generation using Particle Swarm Optimization

International Journal of Swarm Intelligence Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

Particle Swarm Optimization, as a novel evolutionary computing technique, has succeeded in many continuous problems, but research on discrete problems especially combinatorial optimization problem has been done little [4,5]. 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.