• REVISED MAXSMINT ROUTING TECHNIQUE FOR OPTIMIZATION

Abstract

One of the concepts of networks, the shortest path technique has been analyzed extensively for many years. Though there are many techniques to find out the shortest path, only few of them handled the problem based on time. This paper introduces an innovative algorithm, Revised MAXSMINT (Maximizing Speed and Minimizing Time) for finding out the shortest route in a railway network. This new algorithm deals with determining the shortest time taking route which applies depth first search, pruning, backtracking, and also the basic shortest path technique on the time expanded diagraph to optimize time. Our technique is applied to get the optimum time based route on a directed graph. This approach is more comprehensive and is verified to provide greater efficiency and lesser process time than the basic methodologies.