Discrete Fuzzy Particle Swarm Optimization for Solving Traveling Salesman Problem
N. Salmani Niasar, J. Shanbezade, M.M. Perdam, Morteza Mohajeri · 2009
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.