Call for Paper - November 2023 Edition
IJCA solicits original research papers for the November 2023 Edition. Last date of manuscript submission is October 20, 2023. Read More

Solving City Routing Issue with Particle Swarm Optimization

International Journal of Computer Applications
© 2012 by IJCA Journal
Volume 47 - Number 15
Year of Publication: 2012
Sarman K. Hadia
Arjun H. Joshi
Chaitalee K. Patel
Yogesh P Kosta

Sarman K Hadia, Arjun H Joshi, Chaitalee K Patel and Yogesh P Kosta. Article: Solving City Routing Issue with Particle Swarm Optimization. International Journal of Computer Applications 47(15):30-38, June 2012. Full text available. BibTeX

	author = {Sarman K. Hadia and Arjun H. Joshi and Chaitalee K. Patel and Yogesh P Kosta},
	title = {Article: Solving City Routing Issue with Particle Swarm Optimization},
	journal = {International Journal of Computer Applications},
	year = {2012},
	volume = {47},
	number = {15},
	pages = {30-38},
	month = {June},
	note = {Full text available}


The city routing issue is the problem to find a shortest tour of minimum length on a fully connected graph. Various Nature-inspired algorithms have been proposed towards this problem. This paper proposes an application of Particle Swarm Optimization for this Issue. Results are achieved with the concept of Swap Operator and Sequence of Swap.


  • Angeline P. Evolutionary Optimization versus Particle Swarm Optimization: Philosophy and Performance Difference. The 7th Annual Conference. On Evolutionary Programming, San Diego, USA, 1998.
  • Huang Lan Zhou Chunguang,Wang Kangping. Hybrid Ant . Colony algorithm for Traveling Salesman Problem. Progress In' Natural Science. Vol 13 No. 4(Cbina),April2003.
  • Kang-Ping Wang, lan Huang, Chun-Guang Zhou, Wei Pang, " Particle Swarm Optimization For Travelling Salesman Problem", IEEE 2003.
  • Kennedy J, and Spears W. Matching algorithms to Problems: An Experimental Test of the Particle Swarm and Some Genetic Algorithms on the Multimodal Problem Generator. IEEE International Conference on Evolutionary Computation, Anchorage, Alaska, USA, 1998.
  • Kennedy J, Eberhart R. Particle Swarm Optimization, IEEE International Conference on Neural Networks (Perth, Australia), IEEE Service Center, Piscataway, NJ, IV: 1942-1948, 1995.
  • KP. Wang, L. Huang, C. G. Zhou, W. Pang, Particle swarm optimization for traveling salesman problem, International conference on Machne Learning and Cybernatics 3 (2003) 1583-1585
  • M. Clerc, in: Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem New Optimization Techniques in Engineering, Springer, 2004, pp. 219–239.
  • M. Clerc, Discrete particle swarm optimization illustrated by the traveling salesman problem, http://www. mauriceclerc. net, 2000.
  • Shuang Cong, Yajun Jia and Ke Deng, " Particle Swarm And Ant Colony Algorithms and their Applications in Chinese Traveling Salesman Problem"
  • Zhou C G et al. Computing Intelligence (in Chinese) Changchnn: Publishing House of Jilin University, 1585.