A modified particle swarm optimization algorithm and its application for solving traveling salesman problem

Proceedings of 2005 International Conference on Neural Networks and Brain Proceedings, ICNNB'05

Volumn 2, Issue , 2005, Pages 689-694

  Wang, Cuiru ^a   Zhang, Jiangwei ^a   Yang, Jing ^a   Hu, Chaoju ^a   Liu, Jun ^a  

^a NORTH CHINA ELECTRIC POWER UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; MATHEMATICAL OPERATORS; MUTAGENESIS; OPTIMIZATION; PROBABILITY; TRAVELING SALESMAN PROBLEM;

BIOLOGICAL NATURAL LAW; COMBINATORIAL OPTIMIZATION PROBLEM; MODIFIED PARTICLE SWARM OPTIMIZATION (MPSO) ALGORITHM; MUTATION;

ALGORITHMS;

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

References (9)

1. Kennedy J, Eberhart R. Particle swarm optimization. In Proc. IEEE Int. Conf. Neural Networks, Piscataway, NJ,1995: 1942-1948.
2. Shi Y, Eberhart R C. Empirical Study of Particle swarm Optimization[C]. Proceedings of the 1999 Congresson Evolutionary Computation. Piscataway, NJ, IEEE Service Center,1999,1945-1950.
3. Yuan Hejin, Wang Cuiru, Zhang Jiangwei, Sun Chenjun. An Improved Particle Swarm Optimization Algorithm and its Application in Reactive Power Optimization of Power System[C]. Progress In Intelligence Computation and Application. Wuhan: China University of Geosciences Press, 2005: 446-453.
4. Shubhra Sankar Ray, Sanghamitra Bandyopadhyay, Sankar K Pal. New Operators of Genetic Algorithms for Traveling Salesman Problem[C]. In: 17th International Conference on Pattern Recognition. 2004: 497-500.
5. Gang Feng,Christos Douligeris. Using Hopfield Networks to Solve Traveling Salesman Problems Based on Stable State Analysis Technique[C]. International Joint Conference on Neural Networks. Piscataway, NJ: Institute of Electrical and Electronics Engineers Inc, 2000: 24-27.
6. Csorba K, Todor B. Ant search on large maps to find wide paths[C]. Proceedings of 2nd International IEEE Conference on Intelligent Systems. New York, NY: Institute of Electrical and Electronics Engineers Inc, 2004:2-4
7. Maurice Clerc. Discrete particle swarm optimization illustrated by the traveling salesman problem[DB]. http://www.mauriceclerc. net, 2000.
8. nd International Conference on Machine Learning and Cybernetics. Piscataway, NJ: IEEE Operations Center, 2003: 1583-1586.
9. Liu ren-ren. The Design and Analysis of Computer Algorithms[M]. Wuhan: Wuhan University of Technology Press. China, 2003,12:121-124.