Particle swarm optimization-based algorithms for TSP and generalized TSP

Information Processing Letters

Volumn 103, Issue 5, 2007, Pages 169-176

  Shi, X H ^a   Liang, Y C ^a,b   Lee, H P ^b,c   Lu, C ^b   Wang, Q X ^a  

^a JILIN UNIVERSITY   (China)

^b INSTITUTE OF HIGH PERFORMANCE COMPUTING   (Singapore)

^c NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Algorithms; Generalized traveling salesman problem; Particle swarm optimization; Swap operator; Traveling salesman problem

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; PROBLEM SOLVING; TRAVELING SALESMAN PROBLEM;

GENERALIZED TRAVELING SALESMAN PROBLEM; PARTICLE SWARM OPTIMIZATION; SWAP OPERATOR;

OPTIMIZATION;

EID: 34250187782     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2007.03.010     Document Type: Article

References (25)

1. Kennedy J., and Eberhart R.C. Particle swarm optimization. Proceedings of the IEEE International Conference on Neural Networks, Perth, Australia vol. 4 (1995), IEEE Service Center, Piscataway, NJ 1942-1948
2. Angeline P.J. Evolutionary optimization versus particle swarm optimization: philosophy and performance differences. Evolutionary Programming 7 (1998) 601-610
3. Clerc M., and Kennedy J. The particle swarm-explosion, stability, and convergence in a multidimensional complex space. IEEE Transactions on Evolutionary Computation 6 (2002) 58-73
4. Trelea I.C. The particle swarm optimization algorithm: convergence analysis and parameter selection. Information Processing Letters 85 (2003) 317-325
5. Chang J.F., Chu S.C., Roddick J.F., and Pan J.S. A parallel particle swarm optimization algorithm with communication strategies. Journal of Information Science and Engineering 4 21 (2005) 809-818
6. J. Kennedy, R.C. Eberhart, Discrete binary version of the particle swarm algorithm, in: Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, vol. 5, Orlando, Florida, USA, 1997, pp. 4104-4108
7. Clerc M. Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem New Optimization Techniques in Engineering (2004), Springer 219-239
8. Bellman R.E. Dynamic programming treatment of the traveling salesman problem. Journal of the ACM 9 (1962) 61-63
9. Bellmore M., and Nemhauser G.L. The traveling salesman problem: a survey. Operations Research 16 (1968) 538-558
10. Goldberg D.E. Messy genetic algorithms: motivation, analysis, and first results. Complex Systems 3 (1989) 493-530
11. Ausiello G., Demange M., Laura L., and Paschos V. Algorithms for the on-line quota traveling salesman problem. Information Process Letters 92 (2004) 89-94
12. Munakata T., and Nakamura Y. Temperature control for simulated annealing. Physical Review E 64 (2001) 046127
13. Fomin F.V., and Lingas A. Approximation algorithms for time-dependent orienteering. Information Process Letters 83 (2002) 57-62
14. Huang L., Zhou C.G., and Wang K.P. Hybrid ant colony algorithm for traveling salesman problem. Progress in Natural Science 4 13 (2003) 295-299
15. Clerc M. Discrete particle swarm optimization illustrated by the traveling salesman problem (2000). http://www.mauriceclerc.net
16. Hendtlass T. Preserving Diversity in Particle Swarm Optimization. Lecture Notes in Computer Science vol. 2718 (2003), Springer 4104-4108
17. Wang K.P., Huang L., Zhou C.G., and Pang W. Particle swarm optimization for traveling salesman problem. International Conference on Machine Learning and Cybernetics 3 (2003) 1583-1585
18. Henry-Labordere A.L. The record balancing problem: a dynamic programming solution of a generalized traveling salesman problem. RIRO B 2 (1969) 43-49
19. Saskena J.P. Mathematical model for scheduling clients through welfare agencies. CORS J. 8 (1970) 185-200
20. Srivastava S.S., Kumar S., Garg R.C., and Sen P. Generalized traveling salesman problem through n sets of nodes. CORS J. 7 (1969) 97-101
21. Lien Y.N., Ma E., and Wah B.W.-S. Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem. Information Sciences 74 (1993) 177-189
22. Fischetti M., Salazar J.J., and Toth P. A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Operations Research 45 (1997) 378-394
23. Wu C.G., Liang Y.C., Lee H.P., and Lu C. A generalized chromosome genetic algorithm for generalized traveling salesman problems and its applications for machining. Physical Review E 70 (2004) 016701-1-13
24. Reinelt G. TSPLIB-A traveling salesman problem library. ORSA Journal on Computing 3 4 (1991) 376-384
25. Laporte G., Asef-vaziri A., and Sriskandarajah C. Some applications of the generalized traveling salesman problem. Journal of the Operational Research Society 47 (1996) 1461-1467