A Survey on Shortest Path Routing Algorithms for Public Transport Travel

Routing is the act of moving information across a network from a source to a destination. Along the way, at least one intermediate node typically is encountered. Routing is often contrasted with bridging, which might seem to accomplish precisely the same thing to the casual observer. Routing involves two basic activities: determining optimal routing paths and transporting information groups through a network. Routing also refers to path finding between source and destination. This literature review investigates some of the gateways to path finding in different networks that are listed in present research literature. A selected set of different approaches are highlighted and set in a broader context, illustrating the various aspects of path finding in different networks. Because path finding is applicable to many kinds of networks, such as roads, utilities, water, electricity, telecommunications and computer networks alike, the total number of algorithms that have been developed over the years is immense. The aim of this survey is to compromise a selected cross-section of approaches towards path finding and the related fields of research, such as transportation GIS, network analysis, operations research, artificial intelligence and robotics, to mention just a few examples where path finding theories are employed. KeywordsRouting, Shortest path algorithms, ITS, KSP.