Implementation of Shortest Path in Packet Switching Network Using Genetic Algorithm

Free registration required

Executive Summary

The problem of finding the optimal path between two nodes is a well known problem in network analysis. Optimal routing has been widely studied for interconnection networks this dissertation work considers the problem of finding the optimal path. A Genetic algorithm based strategy is proposed and the algorithm has been developed to find the Optimal Path. This paper work presents a genetic algorithmic approach to the shortest path routing problem. Variable-length chromosomes and their genes have been used for encoding the problem. The crossover operation exchanges partial chromosomes at positionally independent crossing sites and the mutation operation maintains the genetic diversity of the population.

  • Format: PDF
  • Size: 441.6 KB