IJSTR

International Journal of Scientific & Technology Research

IJSTR@Facebook IJSTR@Twitter IJSTR@Linkedin
Home About Us Scope Editorial Board Blog/Latest News Contact Us
CALL FOR PAPERS
AUTHORS
DOWNLOADS
CONTACT
QR CODE
IJSTR-QR Code

IJSTR >> Volume 5 - Issue 3, March 2016 Edition



International Journal of Scientific & Technology Research  
International Journal of Scientific & Technology Research

Website: http://www.ijstr.org

ISSN 2277-8616



Modified Pagerank Algorithm Based Real-Time Metropolitan Vehicular Traffic Routing Using GPS Crowdsourcing Data

[Full Text]

 

AUTHOR(S)

Adithya Guru Vaishnav.S

 

KEYWORDS

PageRank Algorithm, Global Positioning System (GPS), Google Maps, Google Crowdsourcing, Nascent Rank algorithm

 

ABSTRACT

This paper aims at providing a theoretical framework to find an optimized route from any source to destination considering the real-time traffic congestion issues. The distance of various possible routes from the source and destination are calculated and a PathRank is allocated in the descending order of distance to each possible path. Each intermediate locations are considered as nodes of a graph and the edges are represented by real-time traffic flow monitored using GoogleMaps GPS crowdsourcing data. The Page Rank is calculated for each intermediate node. From the values of PageRank and PathRank, the minimum sum term is used to find an optimized route with minimal trade-off between shortest path and real-time traffic.

 

REFERENCES

[1] Anatomy of a Large- scale Hypertextual Web Search by Larry Page and Sergey Brin(1997).

[2] http://www.montana.edu/gps/understd.html

[3] http://gis.stackexchange.com/questions/58530/find- Euclidean-distance-in-gps

[4] http://electronics.howstuffworks.com/how-does-google- Maps-predict-traffic.html

[5] http://www.citymetric.com/horizons/how-googles-geo-crowdsourcing-transforming-map-626

[6] L. Page, S. Brin, R. Motwani, and T. Winograd, “The PageRank citation ranking: bringing order to the web,” Technical Report 1999-66, Stanford InfoLab, 1999.

[7] http://www.math.cornell.edu/~mec/Winter2009/RalucaRemus/Lecture3/lecture3.html

[8] Goldberg, A.V., Harrelson, C.: Computing the shortest path: A∗ meets graph theory. In: 16th ACM-SIAM Symposium on Discrete Algorithms, pp. 156–165. ACM Press, New York (2005)

[9] Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on System Science and Cybernetics 4(2), 100–107 (1968)

[10] Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959)