Solving Routing Problem using Particle Swarm Optimization

Abstract

In a graph there are so many paths can exist from a source to a destination node. Among them finding optimal path is very difficult problem. It is an NP hard problem to find path in a graph. In this paper a swarm intelligence technique called Particle swarm Optimization is used to solve routing problem which give optimal path from graph. Here discrete mathematics is used to encode particle in PSO, which break search space in small search space and solve this discrete optimization.