CFP last date
20 May 2024
Reseach Article

Algorithm for Route Planning via Facilities with Time Dependent

by Pramod Singh Rathore, Atul Chaudhary
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 64 - Number 6
Year of Publication: 2013
Authors: Pramod Singh Rathore, Atul Chaudhary
10.5120/10640-5393

Pramod Singh Rathore, Atul Chaudhary . Algorithm for Route Planning via Facilities with Time Dependent. International Journal of Computer Applications. 64, 6 ( February 2013), 26-29. DOI=10.5120/10640-5393

@article{ 10.5120/10640-5393,
author = { Pramod Singh Rathore, Atul Chaudhary },
title = { Algorithm for Route Planning via Facilities with Time Dependent },
journal = { International Journal of Computer Applications },
issue_date = { February 2013 },
volume = { 64 },
number = { 6 },
month = { February },
year = { 2013 },
issn = { 0975-8887 },
pages = { 26-29 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume64/number6/10640-5393/ },
doi = { 10.5120/10640-5393 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:15:42.644399+05:30
%A Pramod Singh Rathore
%A Atul Chaudhary
%T Algorithm for Route Planning via Facilities with Time Dependent
%J International Journal of Computer Applications
%@ 0975-8887
%V 64
%N 6
%P 26-29
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In today's century , people are looking for faster and efficient communication for travelling from source to destination via facilities. As the human tendency always try to go from source to cover or attend some facilities and then reach to destination within a required time. This paper focus on algorithm for optimal route planning via facility ( i. e petrol, grocery etc) with time dependent shortest path. The algorithm proposed here to minimize the travel time and provide a optimal path from source to destination with the facilities come in our path. We present here a algorithm on route planning which minimize the distance as well as time from source to destination.

References
  1. K. Mouratidis, M. L. Yiu, D. Papadias, and N. Mamoulis, "Continuous Nearest Neighbor Monitoring in Road Networks," Proc. 32nd Int'l Conf. Very Large Data Bases (VLDB), pp. 43-54, 2006.
  2. Bolin. D and Xu. Y. J and Lu. Q, Finding time-dependent shortest path over large graphs. "International conference on Extending database technology", France, March 2008, pp. 205-216.
  3. F. Li, D. Chen, M. Hadjielefttherious, G. Kollios, S. Teng, On trip planning queries in spatial databases, SSTD, 2005.
  4. Xiaobin MA, Shashi Shekhar, Hui Xiong, Pusheng Zhang, Exploiting a Page-Level Upper Bound for Multi-Type Nearest Neighbor Queries, ACM-GIS, 2006.
  5. Athanasios Papoulis, S. Unnikrishna Pillai, Probability,Random Variables and Stochastic Process, 4th edition, McGrawHill, 2002.
  6. J. H. Rillings and R. J. Betsold. Advanced Driver Information Systems. IEEE Trans. on Vehicular Technology, 1991.
  7. M. Sharifzadeh, M. Kolahdouzan, C. Shahabi, The optomal sequenced route query, TR 05-840, CS, USC, January 2005.
  8. Jin Fu Leng Wen Zeng, "An Improved Shortest Path Algorithm for Computing One-to-One Shortest Paths on Road Networks", Fac. of Inf. Eng. , China Univ. of Geosci. , Wuhan, China, IEEE, 26 April 2010
  9. S. Shekhar, R. R. Vatsava, X. Ma, J. Yoo, Navigation Systems: A Spatial Database Perspective, In chapter 3 of the book, Location-Based Services, 2003.
  10. J. S. Yoo et al, S. Shekhar, In-Route Nearest Neighbor Queries, Geoinformatica, 9(2), June, 2005.
Index Terms

Computer Science
Information Sciences

Keywords

Location-based services nearest query Road network and Route planning