A discrete PSO method for generalized TSP problem

Proceedings of 2004 International Conference on Machine Learning and Cybernetics

Volumn 4, Issue , 2004, Pages 2378-2383

  Shi, X H ^a   Xing, X L ^b   Wang, Q X ^a   Zhang, L H ^c   Yang, X W ^d   Zhou, C G ^a   Liang, Y C ^a  

^a JILIN UNIVERSITY   (China)

^b BEIJING INSTITUTE OF TECHNOLOGY   (China)

^c Zoonosis prevention and control   (China)

^d SOUTH CHINA UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Generalized traveling salesman problem; Particle swarm optimization

Indexed keywords

COMPUTER PROGRAMMING; EVOLUTIONARY ALGORITHMS; HIERARCHICAL SYSTEMS; INTELLIGENT NETWORKS; ITERATIVE METHODS; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; OPTIMIZATION; PROBLEM SOLVING;

DYNAMIC PROGRAMMING TECHNIQUES; GENERALIZED TRAVELLING SALESMAN PROBLEM (GTSP); HENRY-LABORDERE; PARTICLE SWARM OPTIMIZATION (PSO);

TRAVELING SALESMAN PROBLEM;

EID: 6344240520     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. Bellman R.E., Dynamic programming treatment of the traveling salesman problem, Journal of the ACM, Vol. 9, pp. 61-63, 1962.
2. Bellmore M., Nemhauser G.L., The traveling salesman problem: a survey, Operations Res. Vol. 16, pp. 538-558, 1968.
3. Karp R.M., Probabilistic analysis of partitioning algorithms for the traveling-salesman problem in the plane, Math. of Operations Research, Vol. 2, pp. 209-224, 1977.
4. Goldberg D.E., Messy genetic algorithms: Motivation, Analysis, and First results, Complex Systems, Vol. 3, pp. 493-530, 1989.
5. Bowler N.E., Fink T.M.A., Ball R.C., Characterization of the probabilistic traveling salesman problem, Phys. Rev. E, Vol. 68, 036703, 2003.
6. Munakata T., Nakamura Y., Temperature control for simulated annealing, Phys. Rev. E, Vol. 64, 046127, 2001.
7. Bentner J. et al., Optimization of the time-dependent traveling salesman problem with Monte Carlo methods, Physical Review E, Vol. 64, 036701, 2001.
8. Henry-Labordere A.L., The record balancing problem: a dynamic programming solution of a generalized traveling salesman problem, RIRO B, Vol. 2, pp. 43-49, 1969.
9. Saskena J.P., Mathematical model for scheduling clients through welfare agencies, CORS J, Vol. 8, pp. 185-200, 1970.
10. Srivastava S.S. et al., Generalized traveling salesman problem through n sets of nodes, CORS J, Vol. 7, pp. 97-101, 1969.
11. Lien Y.N., Ma E., Wah B.W.-S., Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem, Information Sciences, Vol. 74, pp. 177-189, 1993.
12. Fischetti M., Salazar J.J., Toth P., A branch-and-cut algorithm for the symmetric generalized traveling salesman problem, Operations Research, Vol. 45, pp. 378-394, 1997.
13. Wu C.G. et al., A Generalized chromosome genetic algorithm for generalized traveling salesman problems and its applications for machining, Phys. Rev. E (in press).
14. Kennedy J., Eberhart R.C., , Particle swarm optimization, Proceedings of the IEEE International Conference on Neural Networks, pp.1942-1948, 1995.
15. Angeline P.J., Evolutionary optimization versus particle swarm optimization: philosophy sind performance differences, Evolutionary Programming, vol. VII, Berlin, Springer, pp. 601-610, 1998.
16. Clerc M., Kennedy J., The particle swarm-explosion, stability, and convergence in a multidimensional complex space, IEEE Transactions on Evolutionary Computation, Vol. 6, pp. 58-73, 2002.
17. Trelea I.C., The particle swarm optimization algorithm: convergence analysis and parameter selection, Information Processing Letters, Vol. 85, pp. 317-325, 2003.
18. Kennedy J., Eberhart R.C., Discrete binary version of the particle swarm algorithm, Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, Vol. 5, pp. 4104-4108, 1997.
19. Hendlass T., Preserving Diversity in Particle Swarm Optimization, Lecture Notes in Computer Science, Vol. 2718, pp. 4104-4108, 2003.
20. Wang K.P. et al, Particle swarm optimization for traveling salesman problem, International Conference on Machine Learning and Cybernetics, Vol. 3, pp. 1583-1585, 2003.
21. Reinelt G., TSPLIB-A Traveling Salesman Problem Library, ORSA Journal on Computing, Vol. 3, pp. 376-384, 1991.