Public conveyance system for shortest path nding for real road network
Iosr Journals, Mathur Agam, Mayuresh Jakhotia, Lavalekar Anish, Nikita Magar · Figshare · 2015
This article analyzes problems of determining the shortest path and optimal route amongst the given stoppages. The model of the problem is presented as a directional graph, where nodes are pickup points (termed as stoppage point in database) and crossings outside stoppage points and edges are roads among stoppage points and crossings. Each node has some information attached to it: stoppageId, stoppageName, latitude, longitude and numberOfPassengers of the stop, maintenance organizations, and mark(s) of the crossing(s). All pickup points are connected by roads. These roads are considered as the edges of the graph. Edges also have information attached to it: roadId, source, destination, distance, time etc.We have selected Floyd Warshall algorithm to nd the shortest path between two stoppages. This algorithm works in two stages: in rst stage, it nds the shortest path between all stoppages, and in second stage it nds optimized route to visit some of these stoppages. The solution is displayed in the form of shortest distance and time between two locations. The program is written in java language. It uses 3 tables as input from database : nodes, vehicle details and road. This paper gives implementation outcome of Floyd Warshall algorithm to solve the all pairs shortestpath problem for directed road graph system. We have considered an example of a map of Pune. Keyword: Adjacency matrix,intermediate path,optimal route, shortest path,transitive closure I. Introduction Now days in the current scenario companies and schools provide transportation facilities to their employees and students from their organizations to their respective houses and vice versa. The purpose of this article is to present an interface between a traveling agency and its traveller so that, the subscribers can keep a track of the service they have subscribed.A key problem in public conveyance system is the computation of shortest paths between di erent locations for a given region. Sometimes this computation has to be done in real time. During the literature survey we found how di cult it is to nd the shortest path covering all pickup points and how to allocate available transport vehicles to these speci c routes manually. There is always a need to nd optimal path for their operational viability. So, just the idea that our system will help in e cient allocation of vehicles and shortest route creation to save time and fuel consumption. The system scope is to design such system for a small area of the city.