Oscar Correa
Abstract
In its current form, ride-sharing is responsible for a small fraction of traffic load compared to other transportation modes, especially private vehicles. As its benefits became more evident, and obstacles, e.g., lack of liability legislation, that may hinder its larger scale adoption are being overcome, ride-sharing will be a more common mode of transportation. In particular, autonomous vehicles (AVs) are showing their proficiency on the roads, which may also catalyze ride-sharing ubiquity. For example, while an AV owner is at work, he may find it appealing to offer his AV as a service or rent it to Uber so that the vehicle serves others’ transportation requests. Furthermore, this disruptive technology is backed up by companies like Google (Waymo), Tesla, and Uber. Therefore, ride-sharing will soon become a source of traffic congestion itself. In this article, we present an efficient congestion-aware ride-sharing algorithm which, instead of finding optimal travel plans based on traffic load generated by other means of transportation, it computes optimal travel plans for thousands of ride-sharing requests within a time interval. Note that in this problem, an optimal travel plan for a group of requests may affect an already computed travel plan for another concurrent group of requests, therefore plans cannot be isolated from each other.
- James Arbib and Tony Seba. 2017. Rethinking transportation 2020-2030. RethinkX, May (2017).Google Scholar
- Roberto Baldacci, Vittorio Maniezzo, and Aristide Mingozzi. 2004. An exact method for the car pooling problem based on Lagrangean column generation. Operations Research 52, 3 (2004), 422--439.Google ScholarDigital Library
- Andreas Baltz and Anand Srivastav. 2004. Fast approximation of minimum multicast congestion—Implementation VERSUS theory. RAIRO - Operations Research 38, 4 (2004), 319--344.Google ScholarCross Ref
- Oscar Correa, Kotagiri Ramamohanarao, Egemen Tanin, and Lars Kulik. 2018. From ride-sourcing to ride-sharing through hot-spots. In Proceedings of the 14th EAI International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services. ACM, New York, NY, 136--145. Google ScholarDigital Library
- S. E. Dreyfus and R. A. Wagner. 1971. The Steiner problem in graphs. Networks 1, 3 (1971), 195--207.Google ScholarCross Ref
- Daniel J. Fagnant and Kara M. Kockelman. 2016. Dynamic ride-sharing and fleet sizing for a system of shared autonomous vehicles in Austin, Texas. Transportation (2016), 1--16.Google Scholar
- Yan Huang, Favyen Bastani, Ruoming Jin, and Xiaoyang Sean Wang. 2014. Large scale real-time ridesharing with service guarantee on road networks. VLDB 7, 14 (2014), 2017--2028. Google ScholarDigital Library
- K. Jansen and H. Zhang. 2002. An approximation algorithm for the multicast congestion problem via minimum Steiner trees. In Proceedings of the 3rd International Workshop on Approximation and Randomized Algorithms in Communication Networks. 77--90.Google Scholar
- Klaus Jansen and Hu Zhang. 2008. Approximation algorithms for general packing problems and their application to the multicast congestion problem. Mathematical Programming 114, 1 (2008), 183--206.Google ScholarDigital Library
- A. K. M. Mustafizur Rahman Khan. 2016. Location Based Services for Groups. Ph.D. Dissertation. Melbourne School of Engineering.Google Scholar
- A. K. M. Mustafizur Rahman Khan, Oscar Correa, Egemen Tanin, Lars Kulik, and Kotagiri Ramamohanarao. 2017. Ride-sharing is about agreeing on a destination. In Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (GIS’17). 6:1--6:10.Google Scholar
- Shuo Ma, Yu Zheng, and Ouri Wolfson. 2013. T-share: A large-scale dynamic taxi ridesharing service. In ICDE. 410--421. Google ScholarDigital Library
- Shuo Ma, Yu Zheng, and Ouri Wolfson. 2015. Real-time city-scale taxi ridesharing. IEEE Transactions on Knowledge and Data Engineering 27, 7 (2015), 1782--1795.Google ScholarDigital Library
- Traffic Assignment Manual. 1964. Bureau of public roads. U.S. Department of Commerce.Google Scholar
- Daniel Mölle, Stefan Richter, and Peter Rossmanith. 2006. A faster algorithm for the Steiner tree problem. Lecture Notes in Computer Science, 561--570. Google ScholarDigital Library
- Martin Olsen. 2013. On the complexity of computing optimal private park-and-ride plans. In Computational Logistics. 73--82.Google Scholar
- Michael Patriksson. 2015. The Traffic Assignment Problem: Models and Methods. Courier Dover Publications.Google Scholar
- D. Van Vliet. 1973. Road assignment: A case for incremental loading. In GLTS Note 30. Department of Planning and Transportation, Greater London Council.Google Scholar
- Santosh Vempala and Berthold Vöcking. 1999. Approximating multicast congestion. In International Symposium on Algorithms and Computation. Springer, 367--372. Google ScholarDigital Library
- Yaoli Wang, Ronny J. Kutadinata, and Stephan Winter. 2016. Activity-based ridesharing: Increasing flexibility by time geography. In Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (GIS’16). 1:1--1:10. Google ScholarDigital Library
Index Terms
- Congestion-Aware Ride-Sharing
Recommendations
The Multi-vehicle Ride-Sharing Problem
WSDM '22: Proceedings of the Fifteenth ACM International Conference on Web Search and Data MiningRide-sharing is one of the most popular models of economical and eco-friendly transportation in modern smart cities, especially when riding hybrid and electric vehicles. Usually multiple passengers with similar itineraries are grouped together, which ...
Passenger Trip Planning using Ride-Sharing Services
CHI '18: Proceedings of the 2018 CHI Conference on Human Factors in Computing SystemsRide-sharing can potentially address transportation challenges such as traffic congestion and air pollution by letting drivers share their cars unused capacity with a number of passengers. However, even though multiple ride-sharing services exist and ...
From Ride-Sourcing to Ride-Sharing through Hot-Spots
MobiQuitous 2017: Proceedings of the 14th EAI International Conference on Mobile and Ubiquitous Systems: Computing, Networking and ServicesSmartphones have allowed us to make ad-hoc travel arrangements. Ride-sharing is emerging as one of the new types of transportation enabled by smartphone revolution. Ride-sharing aims to alleviate current environmental, social and economical issues many ...
Comments