International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 47 - Issue 15 |
Published: June 2012 |
Authors: Sarman K. Hadia, Arjun H. Joshi, Chaitalee K. Patel, Yogesh P Kosta |
![]() |
Sarman K. Hadia, Arjun H. Joshi, Chaitalee K. Patel, Yogesh P Kosta . Solving City Routing Issue with Particle Swarm Optimization. International Journal of Computer Applications. 47, 15 (June 2012), 30-38. DOI=10.5120/7266-0348
@article{ 10.5120/7266-0348, author = { Sarman K. Hadia,Arjun H. Joshi,Chaitalee K. Patel,Yogesh P Kosta }, title = { Solving City Routing Issue with Particle Swarm Optimization }, journal = { International Journal of Computer Applications }, year = { 2012 }, volume = { 47 }, number = { 15 }, pages = { 30-38 }, doi = { 10.5120/7266-0348 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2012 %A Sarman K. Hadia %A Arjun H. Joshi %A Chaitalee K. Patel %A Yogesh P Kosta %T Solving City Routing Issue with Particle Swarm Optimization%T %J International Journal of Computer Applications %V 47 %N 15 %P 30-38 %R 10.5120/7266-0348 %I Foundation of Computer Science (FCS), NY, USA
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.