Accurate and Efficient Route and Travel Time using Location Based Service

Authors

  • Ravi Kumar Adabala  PG Scholar, Department of Computer Science and Engineering, Amalapuram Institute of Management Sciences and College of Engineering, Mummidivaram, East Godavari District, Andhra Pradesh, India
  • Mohammed Alisha  Associate Professor & Head of the Department, Computer Science and Engineering, Amalapuram Institute of Management Sciences and College of Engineering, Mummidivaram, East Godavari District, Andhra Pradesh, , India
  • Dr. D. Mohan Reddy  Professor & Principal, Amalapuram Institute of Management Sciences and College of Engineering, Mummidivaram, East Godavari District, Andhra Pradesh, India

Keywords:

Intelligent Transportation Systems (ITS), Advanced Traffic Management Systems (ATMS), locationbasedservices (LBS), Route-Saver module (RSM)

Abstract

Travel time forecasting models have been considered seriously as a subject of Intelligent Transportation Systems (ITS), especially in the themes of advanced traffic management systems (ATMS) andadvanced traveler information systems (ATIS). Presently, the premiums for the movement time anticipating models have been resuscitated, especially since the market for location-based services (LBS) is predicted to be quickly expanding. While the idea of movement time gauging is generally straightforward, it includes a prominently convoluted undertaking to execute even a basic model. In our proposed framework have three prevalent modules, client module, LBS module and Route-Saver module.

References

  1. J. R. Thomsen, M. L. Yiu, and C. S. Jensen, "Effective caching of shortest paths for location-based services," in Proc. ACM SIGMOD Int.Conf. Manage. Data, 2012, pp. 313-324.
  2. D. Zhang, C.-Y. Chow, Q. Li, X. Zhang, and Y. Xu, "Efficient evaluation of k-NN queries using spatial mashups," in Proc. 12th Int. Conf.Adv. Spatial Temporal Databases, 2011, pp. 348-366.
  3. D. Zhang, C.-Y. Chow, Q. Li, X. Zhang, and Y. Xu, "SMashQ: Spatial mashup framework for k-NN queries in time-dependent road networks,"Distrib. Parallel Databases, vol. 31, pp. 259-287, 2012.
  4. R. Zhong, G. Li, K.-L. Tan, and L. Zhou, "G-tree: An efficient index for knn search on road networks," in Proc. 22nd ACM Int. Conf. Inform.
  5. Qing Song and Xiaofan Wang, "An Efficient Path Complaceation Approach for Road Networks Based on Hierarchical Communities".
  6. Abdeltawab M. et al, "Predictive Tree: An Efficient Index for Predictive Queries On Road Networks"
  7. RuichengZhong, "G-Tree: An Efficient I ndex for KNN Search on Road Networks".
  8. E. Kanoulas, Y. Du, T. Xia, and D. Zhang, "Finding fastest paths on a road network with speed patterns," in Proc. Int. Conf. Data Eng., 2006, p. 1Knowl. Manage., 2013, pp. 39-48.
  9. M. Arjun and K. Sirisha, "Live Activity List Based Shortest Path Calculation", IEEE, Vol. 2,No.9, 2015.
  10. R. Subashini and A. Jeya Christy, "Online Shortest Path based on Live Traffic Circumstances" Vol. 3, No.11, 2014.
  11. DekondaSindhuja, R Vasavi and A KousarNikhath, "Online shortest path complaceation using Live Traffic index", Vol. 25, No. 3, 2015.
  12. "NAVTEQ Maps and Traffic," http://www.navteq.com, 2014.
  13. "TomTom NV," http://www.tomtom.com, 2015.
  14. "Google Maps," http://maps.google.com, 2015.
  15. Yu Li and Man Lung Yiu, "Route-Saver: Leveraging Route APIs for Accurate and Efficient Query Processing at Location-Based Services",Vol. 27, No. 1, 2015.

International Journal of Scientific Research in Science, Engineering and Technology

Downloads

Published

2018-02-28

Issue

Volume 4, Issue 1, January-February-2018

Section

Research Articles

License

Copyright (c) IJSRSET

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
Ravi Kumar Adabala, Mohammed Alisha, Dr. D. Mohan Reddy "Accurate and Efficient Route and Travel Time using Location Based Service" International Journal of Scientific Research in Science, Engineering and Technology (IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 4, Issue 1, pp.453-458, January-February-2018.