Shortest Path Routing for Co-ordinate Based Mobile Networks: A Genetic Algorithm Approach
2012Vol. 6, pp. 50–53
Citations Over Time
Abstract
A genetic algorithm approach for shortest routing path has been proposed in this paper. The different genetic operations have been modeled with co-ordinate based mobile networks. The simulation study confirms the convergence with the Dijkstra's Algorithm.
Related Papers
- → An Improved Shortest Path Algorithm for Computing One-to-One Shortest Paths on Road Networks(2009)19 cited
- A K th shortest path algorithm implemented with bi-directional search(2008)
- An experiment on the performance of shortest path algorithm(2016)
- Analysis of the Shortest Path Algorithm in ITS(2009)