DocumentCode
2754683
Title
Discrete Fuzzy Particle Swarm Optimization for Solving Traveling Salesman Problem
Author
Niasar, N. Salmani ; Shanbezade, J. ; Perdam, M.M. ; Mohajeri, M.
Author_Institution
Dept. of Comput. Eng. Sci. & Res. Univ., IAU, Tehran, Iran
fYear
2009
fDate
17-20 April 2009
Firstpage
162
Lastpage
165
Abstract
Discrete fuzzy PSO (D-FPSO) algorithm based on continues fuzzy PSO is proposed in this paper. According to this new algorithm, charisma is defined to be a fuzzy variable, and more than one particle in each neighborhood is allowed to influence others to a degree that depends on its charisma. Shift-neighborhood and mutation is employed to improve convergence speed and avoid to becoming trapped in the local optima. D-FPSO is evaluated on the TSP problem, comparing performance to other methods based on PSO.
Keywords
convergence; fuzzy set theory; particle swarm optimisation; travelling salesman problems; charisma; continues fuzzy particle swarm optimization; convergence speed; discrete fuzzy particle swarm optimization; mutation; shift-neighborhood; traveling salesman problem; Convergence; Equations; Genetic mutations; Particle swarm optimization; Traveling salesman problems; Disctere PSO; Fuzzy PSO; PSO; TSP;
fLanguage
English
Publisher
ieee
Conference_Titel
Information and Financial Engineering, 2009. ICIFE 2009. International Conference on
Conference_Location
Singapore
Print_ISBN
978-0-7695-3606-4
Type
conf
DOI
10.1109/ICIFE.2009.37
Filename
5189990
Link To Document