Dynamic Taxi-Sharing System Using Dual-Side Searching Algorithm

Authors

  • S. Karthika Department of Information Technology, IFET College of Engineering, Gangarampalaiyam, India
  • D. Saravanan Department of Information Technology, IFET College of Engineering, Gangarampalaiyam, India

DOI:

https://doi.org/10.53555/cse.v2i4.191

Keywords:

Seat Occupancy rate,, Satisfaction rate,, Cloud Dbaas.

Abstract

Now-a-days taxi is an important transportation mode delivering millions of passengers to different locations in urban areas. Most of the passengers depend on taxi for travelling from one place to another. Day-by-day taxi is increasing but passengers did not get the taxi on time and wait for long time. To keep away from this issue, introducing the taxi-sharing system that accepts the passengers ride-request sent from webpage. Utilizing this application all passengers’ details can be added to the database and the administrator is given by an id and password. This id and password can be kept by the administrator. To track the client details are stored in database with id verification. The server will respond very fast for the allocation and deployment for the owner resources. And it recognizes very fast for the retrieval time also. 

Downloads

Download data is not yet available.

References

R. Baldacci, V. Maniezzo, and A. Mingozzi, “An exact method for the car pooling problem based on lagrangean column generation,”Oper. Res., vol. 52, no. 3, pp. 422–439, 2004.

R. W. Calvo, F. de Luigi, P. Haastrup, and V. Maniezzo, “A distributed geographic information system for the daily carpoolingproblem,” Comput. Oper. Res., vol. 31, pp. 2263–2278, 2004.

S. Ma, Y. Zheng, and O. Wolfson, “TShare: A large-scale dynamicridesharing service,” in Proc. 29th IEEE Int. Conf. Data Eng., 2013,pp. 410–421.

E. Kamar and E. Horvitz, “Collaboration and shared plans in theopen world: Studies of ridesharing,” in Proc. 21st Int. Jont Conf.Artif. Intell., 2009, pp. 187–194.

K. Wong, I. Bell, and G. H. Michael, “Solution of the dial-a-ride problem with multi-dimensional capacity constraints,” Int. Trans.Oper. Res., vol. 13, no. 3, pp. 195–208, May 2006.

Z. Xiang, C. Chu, and H. Chen, “A fast heuristic for solving alarge-scale static diala-ride problem under complexconstraints,”Eur. J. Oper. Res., vol. 174, no. 2, pp. 1117–1139, 2006.

J. Yuan, Y. Zheng, C. Zhang, W. Xie, X. Xie, G. Sun, and Y.Huang, “T-drive: Driving directions based on taxi trajectories,”in Proc. 18th SIGSPATIAL Int. Conf. Adv. Geographic Inf. Syst.,2010, pp. 99–108.

J. Yuan, Y. Zheng, X. Xie, and G. Sun, “Driving with knowledgefrom the physical world,” in Proc. 17th ACM SIGKDD Int. Conf.Knowl. Discovery Data Mining, 2011, pp. 316–324.

O. Wolfson, A. P. Sistla, B. Xu, J. Zhou, S. Chamberlain, Y. Yesha,and N. Rishe, “Tracking moving objects using database technologyin DOMINO,” in Proc. 4th Int. Workshop Next Generation Inf.Technol. Syst., 1999, pp. 112–119.

J. Yuan, Y. Zheng, C. Zhang, X. Xie, and G.-Z. Sun, “An-voting based map matching algorithm,” in Proc.11th Int. Conf. Mobile Data Manage., 2010, pp. 43–52

Downloads

Published

2016-04-30

How to Cite

Karthika, S., & Saravanan, D. (2016). Dynamic Taxi-Sharing System Using Dual-Side Searching Algorithm. International Journal For Research In Advanced Computer Science And Engineering, 2(4), 01–05. https://doi.org/10.53555/cse.v2i4.191