| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 862770 | Procedia Engineering | 2012 | 8 Pages |
In this paper we introduce a novel algorithm, MAXSMINT (Maximizing Speed and Minimizing Time) for determining the shortest route in a railway network. In today's busy world, no one takes the effort to determine the shortest route to the destination but expect to reach their destinations in the shortest possible time. Thus, this system involves providing the shortest time taking path to their destination automatically. Optimization is achieved by splitting the entire process into two. First finding the shortest paths to the end station and then calculating and zero down to the final shortest time taking path. This approach is more generalized and is proved to offer higher efficiency and shorter process time then the conventional methodologies.
