Public conveyance system for shortest path nding for real road network

Journal Title: IOSR Journals (IOSR Journal of Computer Engineering) - Year 2015, Vol 17, Issue 5

Abstract

Abstract: 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 (termedas 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

Authors and Affiliations

Agam Mathur , Mayuresh Jakhotia , Anish Lavalekar , Nikita Magar

Keywords

Related Articles

 HMM and its application in MSA

 Abstract: This document gives an insightinto HMM and its application in context of Multiple sequence alignment (MSA). Various computational approaches proliferatedin response to resolve the complexities of Human...

 A Study on Geomorphological Response for Runoff Prediction in Small Watershed

 Abstract: Hydrological data of Arki sub-watershed comprising an area of 2460 hectares of a hilly catchment of Upper River Gambhar, located in mid hills of Solan district of Himachal Pradesh were analyzed to study t...

 Using Concept of Steganography and Visual Cryptography for Secured Data hiding

 Abstract: The most advanced and updated Shamir Encryption algorithm is efficient enough to prevent and stop unauthorized and illegal access to the secured encoded data. It is best to solution to ensure reliability...

An Enhanced Scheme for Hiding Text in Wave Files

Abstract: Steganography is a term applied to any number of processes that embed an object into another object in order to deceive any observer or adversary. An embedding algorithm for hiding messages into wave files or a...

An application of flexible query interface to relational databases

Abstract: The use of databases has for long been for the computer elites in the society as well as multinationals that can pay for their services, and these has inhibited the scope and wide use of database applications....

Download PDF file
  • EP ID EP153457
  • DOI -
  • Views 85
  • Downloads 0

How To Cite

Agam Mathur, Mayuresh Jakhotia, Anish Lavalekar, Nikita Magar (2015).  Public conveyance system for shortest path nding for real road network. IOSR Journals (IOSR Journal of Computer Engineering), 17(5), 26-30. https://europub.co.uk/articles/-A-153457