Set of shorter paths using genetic algorithm and evaluating network delay

The essence of this paper is to formulate the delay factor in transmitting a data unit from source to destination with multiple opinion regarding shorter, shortest path and the traffic using Geographic Information System. The feasible paths are diagnose with shortest path Algorithm and verified using genetic Algorithm. The proposed shortest path algorithm detects the shortest path with other possible shorter paths form source to destination, and implemented with developed formulae to calculate the delay factors in the transmitting media. Selection and connection between nodes are done with Geographic Information System. Transfer of packets through medium, transfer of liquid into pipelines and transfer of goods over different medium (rail, road and air) requires faster modes of communication with reducing delay factor. In the run of multiplicity algorithms like dijkstra´s provides a single channel from source to destination. But the proposed algorithm, not only provide multiple option but also calculates the possible delay in the network. The proposed algorithm is equated with dijkstra´s algorithm and results obtained are acceptable. Simulated results are formulated using Matlab. The result assures the experimental potency of the algorithm and the work.