Solving City Routing Issue with Particle Swarm Optimization
Sarman K. Hadia, Arjun H. Joshi, Chaitalee K. Patel, Yogeshwar Prasad Kosta · International Journal of Computer Applications · 2012
The city routing issue is the problem to find a shortest tour of minimum length on a fully connected graph.Various Natureinspired 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.