Charles Tian
ABSTRACT
This demo presents Noah: a dynamic ridesharing system. Noah supports large scale real-time ridesharing with service guarantee on road networks. Taxis and trip requests are dynamically matched. Different from traditional systems, a taxi can have more than one customer on board given that all waiting time and service time constraints of trips are satisfied. Noah's real-time response relies on three main components: (1) a fast shortest path algorithm with caching on road networks; (2) fast dynamic matching algorithms to schedule ridesharing on the fly; (3) a spatial indexing method for fast retrieving moving taxis. Users will be able to submit requests from a smartphone, choose specific parameters such as number of taxis in the system, service constraints, and matching algorithms, to explore the internal functionalities and implementations of Noah. The system analyzer will show the system performance including average waiting time, average detour percentage, average response time, and average level of sharing. Taxis, routes, and requests will be animated and visualized through Google Maps API. The demo is based on trips of 17,000 Shanghai taxis for one day (May 29, 2009); the dataset contains 432,327 trips. Each trip includes the starting and destination coordinates and the start time. An iPhone application is implemented to allow users to submit a trip request to the Noah system during the demonstration.
- K. Ghoseiri, A. Haghani, and M. Hamedi, "Real-time rideshare matching problem," Final Report of UMD-2009-05, U.S. Department of Transportation, 2011.Google Scholar
- J. F. Dillenburg, O.Wolfson, and P. C. Nelson, "The intelligent travel assistant," in The IEEE 5th International Conference on Intelligent Transportation Systems, 2002, pp. 691--696.Google Scholar
- TICKENGO, "Tickengo," http://tickengo.com.Google Scholar
- G. Gidofalvi, T. B. Pedersen, T. Risch, and E. Zeitler, "Highly scalable trip grouping for large-scale collective transportation systems," in Proceedings of the 11th international conference on Extending database technology: Advances in database technology, ser. EDBT '08, 2008, pp. 678--689. Google ScholarDigital Library
- M. Lipmann, X. Lu, W. d. Paepe, R. Sitters, and L. Stougie, "On-line dial-a-ride problems under a restricted information model," in Proceedings of the 10th Annual European Symposium on Algorithms, 2002, pp. 674--685. Google ScholarDigital Library
- D. Delling, P. Sanders, D. Schultes, and D. Wagner, "Algorithmics of large and complex networks," D. Lerner, J.and Wagner and K. Zweig, Eds., 2009, ch. Engineering Route Planning Algorithms. Google ScholarDigital Library
- I. Abraham, A. Fiat, A. V. Goldberg, and R. F. Werneck, "Highway dimension, shortest paths, and provably efficient algorithms," in SODA '10, 2010. Google ScholarDigital Library
- I. Abraham, D. Delling, A. V. Goldberg, and R. F. Werneck, "A hub-based labeling algorithm for shortest paths in road networks," in Proceedings of the 10th international conference on Experimental algorithms, 2011. Google ScholarDigital Library
Index Terms
- Noah: a dynamic ridesharing system
Recommendations
Dynamic travel time provision for road networks
GIS '08: Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systemsThe application domain of intelligent transportation is plagued by a shortage of data sources that adequately assess traffic situations. Typically, to provide routing and navigation solutions map attributes in the form of static weights as derived from ...
A Partition-Based Match Making Algorithm for Dynamic Ridesharing
Ridesharing offers the opportunity to make more efficient use of vehicles while preserving the benefits of individual mobility. Presenting ridesharing as a viable option for commuters, however, requires minimizing certain inconvenience factors. One of ...
A road timetableTM to aid vehicle routing and scheduling
Both within and between urban conurbations, the time of a journey and the corresponding shortest path in a road network from an origin to a destination may depend on the time of the day, the day of the week and the season of the year. Significant ...
Comments