Discrete particle swarm optimization for TSP: theoretical results and experimental evaluations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6943 LNAI, Issue , 2011, Pages 416-427

  Hoffmann, Matthias ^a   Mühlenthaler, Moritz ^a   Helwig, Sabine ^a   Wanka, Rolf ^a  

^a UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONTINUOUS OPTIMIZATION PROBLEMS; CONVERGENCE BEHAVIORS; CONVERGENCE RATES; DISCRETE OPTIMIZATION PROBLEMS; DISCRETE PARTICLE SWARM OPTIMIZATION; EXPERIMENTAL EVALUATION; PSO ALGORITHMS; SLOW-DOWN EFFECT; THEORETICAL RESULT; TRAVELING SALESPERSON PROBLEM;

ALGORITHMS; COMPETITION; CONVERGENCE OF NUMERICAL METHODS; INTELLIGENT SYSTEMS; PROBLEM SOLVING;

PARTICLE SWARM OPTIMIZATION (PSO);

EID: 80053302692     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-23857-4_40     Document Type: Conference Paper

References (19)

1. Anghinolfi, D., Paolucci, M.: A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times. European Journal of Operational Research 193, 73-85 (2009), doi:10.1016/j.ejor.2007.10.044
2. Clerc, M.: Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem. Website (2000), http://clerc.maurice.free.fr/pso/ pso-tsp/Discrete-PSO-TSP.zip
3. Clerc, M.: Discrete particle swarm optimization, illustrated by the traveling salesman problem. In: Onwubolu, G.C., Babu, B.V. (eds.) New Optimization Techniques in Engineering. Studies in Fuzziness and Soft Computing, pp. 219-239. Springer, Heidelberg (2004)
4. Clerc, M., Kennedy, J.: The particle swarm - Explosion, stability, and convergence in a multidimensional complex space. IEEE Transactions on Evolutionary Computation 6, 58-73 (2002)
5. Eberhart, R.C., Kennedy, J.: A new optimizer using particle swarm theory. In: Proc. 6th International Symposium on Micro Machine and Human Science, pp. 39-43 (1995)
6. Goldbarg, E.F.G., de Souza, G.R., Goldbarg, M.C.: Particle swarm for the traveling salesman problem. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2006. LNCS, vol. 3906, pp. 99-110. Springer, Heidelberg (2006)
7. Gutin, G., Punnen, A.P. (eds.): The Traveling Salesman Problem and Its Variations. Combinatorial Optimization, vol. 12. Springer, Heidelberg (2002)
8. Helwig, S., Wanka, R.: Theoretical analysis of initial particle swarm behavior. In: Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN 2008. LNCS, vol. 5199, pp. 889-898. Springer, Heidelberg (2008)
9. Jiang, M., Luo, Y.P., Yang, S.Y.: Stochastic convergence analysis and parameter selection of the standard particle swarm optimization algorithm. Inf. Process. Lett. 102, 8-16 (2007)
10. Kececioglu, J., Sankoff, D.: Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement. Algorithmica 13, 180-210 (1995)
11. Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proc. IEEE International Conference on Neural Networks, vol. 4, pp. 1942-1948 (1995)
12. Kennedy, J., Eberhart, R.C.: A discrete binary version of the particle swarm algorithm. In: Proc. IEEE Int. Conf. on Systems, Man, and Cybernetics, vol. 5, pp. 4104-4108 (1997)
13. Reinelt, G.: TSPLIB - A traveling salesman problem library. ORSA Journal on Computing 3(4), 376-384 (1991)
14. Shi, X.H., Liang, Y.C., Lee, H.P., Lu, C.,Wang, Q.X.: Particle swarm optimization-based algorithms for TSP and generalized TSP. Inf. Process. Lett. 103, 169-176 (2007)
15. Shi, X.H., Zhou, Y., Wang, L.M., Wang, Q.X., Liang, Y.C.: A discrete particle swarm optimization algorithm for travelling salesman problem. In: Proc. 1st Int. Conf. on Computation Methods (ICCM), vol. 2, pp. 1063-1068 (2004)
16. Solomon, A., Sutcliffe, P., Lister, R.: Sorting circular permutations by reversal. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol. 2748, pp. 319-328. Springer, Heidelberg (2003)
17. Trelea, I.C.: The particle swarm optimization algorithm: Convergence analysis and parameter selection. Inf. Process. Lett. 85, 317-325 (2003)
18. Wang, K.P., Huang, L., Zhou, C.G., Pang, W.: Particle swarm optimization for traveling salesman problem. In: Proc. 2nd Int. Conf. on Machine Learning and Cybernetics, vol. 3, pp. 1583-1585 (2003)
19. Zhong, W., Zhang, J., Chen, W.: A novel discrete particle swarm optimization to solve traveling salesman problem. In: Proc. IEEE Congress on Evolutionary Computation (CEC), pp. 3283-3287 (2007)