Data Driven Simulation Framework for Taxi Ride Sharing

Authors

  • P. Potri Rathna  Information Technology, Mepco Schlenk Engineering College, Sivakasi, Tamil Nadu, India
  • Dr.T.Revathi  Head of Department, Information Technology, Schlenk Engineering College, Sivakasi, Tamil Nadu, India

Keywords:

Taxi Ride-Sharing, Shortest-Path, Scheduler, Scalability, Apache Spark

Abstract

In the modern era vehicles are increasing exponentially with respect to its population. The urban cities are facing many challenges in transportation and energy consumption. The foremost approach will be taxi ride-sharing which effectively reduces traffic congestion, gasoline consumption, and pollution. Our proposed method will simulate a real-time data-driven framework for analysing the taxi ride-sharing in various scenarios. In this approaches the taxies and trips are modelled as separate entities for simulating a rich set of realistic scenarios. A new optimization algorithm is described to address the computational complexity and scalability is achieved by an efficient indexing scheme combined with parallelization. The framework is evaluated using a real-time streaming information obtained from the user.

References

  1. V. Handke and H. Jonuschat, Flexible Ridesharing.? Springer Berlin Heidelberg, 2013.
  2. J. Yang, P. Jaillet, and H. Mahmassani, "Real-time multivehicle truckload pickup and delivery problems," Transportation Science, vol. 38, no. 2, pp. 135?148, 2004.
  3. G. Berbeglia, J.-F. Cordeau, and G. Laporte, "Dynamic pickup and delivery problems," EJOR, vol. 202, no. 1, pp. 8 ? 15, 2010.
  4. A. Marin, "Airport management: taxi planning," Annals of Operations Research, vol. 143, no. 1, pp. 191?202, 2006.
  5. G. Keith, A. Richards, and S. Sharma, "Optimization of taxiway routing and runway scheduling," in AIAA Guidance, Navigation and Control Conference and Exhibit, 2008.
  6. P. Shaw, "Using constraint programming and local search methods to solve vehicle routing problems," in Principles and Practice of Constraint Programming CP98, ser. Lecture Notes in Computer Science, M. Maher and J.-F. Puget, Eds. Springer Berlin Heidelberg, 1998, vol. 1520, pp. 417?431.
  7. B. Coltin and M. Veloso, "Scheduling for transfers in pickup and delivery problems with very large neighborhood search," in AAAI, 2014, pp. 2250?2256.
  8. P. Santi, G. Resta, M. Szell, S. Sobolevsky, S. Strogatz, and C. Ratti, "Quantifying the benefits of vehicle pooling with shareability networks," PNAS, vol. 111, no. 37, pp. 13 290?13 294, 2014.
  9. S. Ma, Y. Zheng, and O. Wolfson, "T-share: A large-scale dynamic taxi ridesharing service," in ICDE. IEEE, 2013.
  10. S. Ma, O. Wolfson, and Y. Zheng, "Real-time city-scale taxi ridesharing," IEEE Transactions on Knowledge Discovery and Data Engineering, vol. 27, pp. 1782?1795, 2015.
  11. Y. Huang, F. Bastani, R. Jin, and X. S. Wang, "Large scale real-time ridesharing with service guarantee on road networks," PVLDB, vol. 7, no. 14, pp. 2017?2028, 2014.
  12. W. M. Herbawi and M. Weber, "A genetic and insertion heuristic algorithm for solving the dynamic ridematching problem with time windows," in GECCO ’12, 2012, pp. 385?392.

Downloads

Published

2017-04-30

Issue

Section

Research Articles

How to Cite

[1]
P. Potri Rathna, Dr.T.Revathi, " Data Driven Simulation Framework for Taxi Ride Sharing, International Journal of Scientific Research in Science and Technology(IJSRST), Online ISSN : 2395-602X, Print ISSN : 2395-6011, Volume 3, Issue 5, pp.122-127, May-June-2017.