Skip to main content
Journal ArticleOPEN ACCESS

Solving City Routing Issue with Particle Swarm Optimization

  • K.Hadia S
  • H. Joshi A
  • K. Patel C
  • et al.
International Journal of Computer Applications (2012) 47(15) 30-38
DOI: 10.5120/7266-0348
N/ACitations
Citations of this article
21Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

K.Hadia, S., H. Joshi, A., K. Patel, C., & P Kosta, Y. (2012). Solving City Routing Issue with Particle Swarm Optimization. International Journal of Computer Applications, 47(15), 30–38. https://doi.org/10.5120/7266-0348

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free