Review Paper on Online Shortest Path Computation
International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
www.ijsr.net | Open Access | Fully Refereed | Peer Reviewed International Journal

ISSN: 2319-7064

Views: 122 , Downloads: 98 | CTR: 80 % | Weekly Popularity: ⮙3

Review Papers | Computer Science & Engineering | India | Volume 4 Issue 3, March 2015

Review Paper on Online Shortest Path Computation

Pratik P.Watane, Prof. Prachi V. Kale

The online shortest path problem aims at computing the shortest path based on live traffic circumstances. The problem of point-to-point fastest path computation in static spatial networks is extensively studied with many pre computation techniques proposed to speed up the computation. Most of the existing approaches make the simplifying assumption that travel times of the network edges are constant. However, the real world spatial networks the edge travel times are time dependent on the arrival time to an edge determines the actual travel time on the edge. we have study online computation of fastest path in time-dependent spatial networks and present a technique which speeds-up the path computation. We show that our fastest path computation based on a bidirectional time-dependent A* search significantly improves the computation time and storage capacity. With extensive experiments using real data-sets (including a variety of large spatial networks with real traffic data) we demonstrate the efficacy of our proposed techniques for online fastest path computation.

Keywords: Shortest path, time dependent spatial network, fastest path computation

Edition: Volume 4 Issue 3, March 2015

Pages: 1782 - 1787

Share this Article

How to Cite this Article?

Pratik P.Watane, Prof. Prachi V. Kale, "Review Paper on Online Shortest Path Computation", International Journal of Science and Research (IJSR), https://www.ijsr.net/search_index_results_paperid.php?id=SUB152522, Volume 4 Issue 3, March 2015, 1782 - 1787

122 PDF Views | 98 PDF Downloads

Download Article PDF



Similar Articles with Keyword 'Shortest path'

Views: 122 , Downloads: 98 | CTR: 80 % | Weekly Popularity: ⮙3

Review Papers, Computer Science & Engineering, India, Volume 4 Issue 3, March 2015

Pages: 1782 - 1787

Review Paper on Online Shortest Path Computation

Pratik P.Watane, Prof. Prachi V. Kale

Share this Article

Views: 144 , Downloads: 102 | CTR: 71 % | Weekly Popularity: ⮙6

Survey Paper, Computer Science & Engineering, India, Volume 4 Issue 9, September 2015

Pages: 1656 - 1659

A Survey on Graph Partitioning Techniques

Santosh Nage, Girish Potdar

Share this Article

Views: 135 , Downloads: 104 | CTR: 77 % | Weekly Popularity: ⮙3

Survey Paper, Computer Science & Engineering, India, Volume 3 Issue 11, November 2014

Pages: 2081 - 2083

Survey of Approximate Shortest Distance Computing Using Improved Shortest Path Tree

Sonali Malode, Mansi Bhonsle

Share this Article

Views: 128 , Downloads: 104 | CTR: 81 % | Weekly Popularity: ⮙4

M.Tech / M.E / PhD Thesis, Computer Science & Engineering, India, Volume 6 Issue 6, June 2017

Pages: 2588 - 2590

A Shortest Path & Directed Acyclic Graph Based Technique for Multipath Routing

Uttara Batham, Mayank Bhatt

Share this Article

Views: 116 , Downloads: 106 | CTR: 91 % | Weekly Popularity: ⮙2

M.Tech / M.E / PhD Thesis, Computer Science & Engineering, India, Volume 3 Issue 6, June 2014

Pages: 696 - 698

Sync Preempted Probability Algorithm in the Integrated Services (IntServ) MPLS Network

Jyoti Tewari, Ankur Dumka, Gulista Khan

Share this Article
Top