Indexing metadata

Identification of Optimum Shortest Path using Multipath Dijkstra’s Algorithm Approach


 
Dublin Core PKP Metadata Items Metadata for this Document
 
1. Title Title of document Identification of Optimum Shortest Path using Multipath Dijkstra’s Algorithm Approach
 
2. Creator Author's name, affiliation, country Kumari Pritee; Research Scholar, Centre for Transportation Systems (CTRANS), IIT Roorkee, Uttarakhand, India
 
2. Creator Author's name, affiliation, country Garg R.D.; Associate Professor, Geomatics Engineering, IIT Roorkee, Uttarakhand, India
 
2. Creator Author's name, affiliation, country (doi: 10.23953/cloud.ijarsg.321)
 
3. Subject Discipline(s)
 
3. Subject Keyword(s) Dijkstra’s algorithm; Geographic information system; PostgreSQL/PostGIS; PgRouting; GeoServer; Web services
 
4. Description Abstract

Many route mappings were done with the help of API of Google maps but do not provide geospatial Routing functionality like overlay, interpolation etc. This project aims to find the shortest path between two or more points by using multipath Dijkstra’s algorithm via PgRouting. Dijkstra’s algorithm provides advantages on time required for selecting the network and building graph over the algorithm speed. In that case, A-star is always preferred over Dijkstra’s algorithm. Dijkstra’s algorithm has a computational complexity of O (n2) with a network consisting of n nodes. This Project explains the steps to prepare the data by converting shape files into SQL files and import it into PostgreSQL/PostGIS, make routing topology, indexes, and queries, dynamically assign costs by PgRouting, and write a custom function ‘plpgsql’ using PL/pgSQL (Procedural programming structured query language) supported by PostgreSQL. This report provides all geospatial functions with dynamic support via PgRouting which allows many clients, like Quantum GIS and Udig, represents client visualization for modification of data and attributes for instantly reflecting changes via PgRouting. PgRouting Provides a framework by which cost parameters are calculated dynamically. This paper specifies the routing of Varanasi city roads using Dijkstra’s algorithm and PgRouting. This article focuses on dynamic routing on the complex network like Varanasi City over the web mapping application so that Client can easily find their shortest route along with Cost parameters.

 
5. Publisher Organizing agency, location
 
6. Contributor Sponsor(s) Ministry of Human Resource Development
 
7. Date (YYYY-MM-DD) 2017-10-30
 
8. Type Status & genre Peer-reviewed Article
 
8. Type Type
 
9. Format File format PDF
 
10. Identifier Uniform Resource Identifier http://technical.cloud-journals.com/index.php/IJARSG/article/view/818
11. Source Journal/conference title; vol., no. (year) International Journal of Advanced Remote Sensing and GIS; Volume 6 (Year 2017)
 
12. Language English=en en
 
14. Coverage Geo-spatial location, chronological period, research sample (gender, age, etc.)
 
15. Rights Copyright and permissions

Copyright Terms & Conditions

Authors who publish with this journal agree to the following terms:

a. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

b. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

c. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work

Cloud Publications reserves the right to amend/change the copyright policy; with/without notice.