Implementing Amalgamation of Graphs on Set of Shorter Path Algorithm Using Genetic Algorithm

The aim of this paper is to verify the algorithm, “Search the Set of Shorter Paths” [23] which clip the graph into levels (Levelled Graph) and find the set of shorter paths from source to destination. When the algorithm operates on heuristically amalgamated graphs of three types is executing properly. The graph or network consists of the amalgamation of different types graph as Roadways, Railways and Airways. The amalgamation can be of any type incorporating packet network, pipeline network for liquid transportation and many more. The algorithm executes efficiently irrespective of the types of graph or network it has been applied to. The algorithm not only finds the shortest path but also find out the other shorter paths from the source to the destination node. The selection of graphs is done arbitrarily as to express the capability of the designed algorithm and to express the connection of nodes with other nodes. The proposed algorithm is compared with dijkstra’s algorithm and the results are satisfactory. Simulated results are formulated using Matlab. The result assures the experimental potential of the algorithm.