Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Future Aware Pricing and Matching for Sustainable On-demand Ride Pooling (2302.10510v3)

Published 21 Feb 2023 in cs.AI and cs.MA

Abstract: The popularity of on-demand ride pooling is owing to the benefits offered to customers (lower prices), taxi drivers (higher revenue), environment (lower carbon footprint due to fewer vehicles) and aggregation companies like Uber (higher revenue). To achieve these benefits, two key interlinked challenges have to be solved effectively: (a) pricing -- setting prices to customer requests for taxis; and (b) matching -- assignment of customers (that accepted the prices) to taxis/cars. Traditionally, both these challenges have been studied individually and using myopic approaches (considering only current requests), without considering the impact of current matching on addressing future requests. In this paper, we develop a novel framework that handles the pricing and matching problems together, while also considering the future impact of the pricing and matching decisions. In our experimental results on a real-world taxi dataset, we demonstrate that our framework can significantly improve revenue (up to 17% and on average 6.4%) in a sustainable manner by reducing the number of vehicles (up to 14% and on average 10.6%) required to obtain a given fixed revenue and the overall distance travelled by vehicles (up to 11.1% and on average 3.7%). That is to say, we are able to provide an ideal win-win scenario for all stakeholders (customers, drivers, aggregator, environment) involved by obtaining higher revenue for customers, drivers, aggregator (ride pooling company) while being good for the environment (due to fewer number of vehicles on the road and lesser fuel consumed).

Definition Search Book Streamline Icon: https://streamlinehq.com
References (25)
  1. On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment. Proceedings of the National Academy of Sciences, 114(3): 462–467.
  2. Pricing in Ride-Sharing Platforms: A Queueing-Theoretic Approach. In Proceedings of the Sixteenth ACM Conference on Economics and Computation, EC ’15, 639. New York, NY, USA: Association for Computing Machinery. ISBN 9781450334105.
  3. Dynamic pricing in ridesharing platforms. ACM SIGecom Exchanges, 15(1): 65–70.
  4. Pricing in ride-share platforms: A queueing-theoretic approach. Available at SSRN 2568258.
  5. Spatial pricing in ride-sharing networks. Operations Research, 67(3): 744–769.
  6. Boeing, G. 2017. OSMnx: New methods for acquiring, constructing, analyzing, and visualizing complex street networks. Computers, Environment and Urban Systems, 65: 126–139.
  7. InBEDE: Integrating Contextual Bandit with TD Learning for Joint Pricing and Dispatch of Ride-Hailing Platforms. In 2019 IEEE International Conference on Data Mining (ICDM), 61–70. IEEE.
  8. Dispatching through pricing: modeling ride-sharing and designing dynamic prices. In Proceedings of the 28th International Joint Conference on Artificial Intelligence, 165–171. AAAI Press.
  9. Balancing efficiency and fairness in on-demand ridesourcing. In Advances in Neural Information Processing Systems, 5309–5319.
  10. Online spatio-temporal matching in stochastic and dynamic domains. Artificial Intelligence, 261: 71–112.
  11. ZAC: A Zone Path Construction Approach for Effective Real-Time Ridesharing. In ICAPS.
  12. Spatio-temporal pricing for ridesharing platforms. In Proceedings of the 2019 ACM Conference on Economics and Computation, 583–583.
  13. T-share: A large-scale dynamic taxi ridesharing service. In Data Engineering (ICDE), 2013 IEEE 29th International Conference on, 410–421. IEEE.
  14. NYYellowTaxi. 2016. New York Yellow Taxi DataSet. http://www.nyc.gov/html/tlc/html/about/trip˙record˙data.shtml. Accessed: 2021-12-04.
  15. Özkan, E. 2020. Joint pricing and matching in ride-sharing systems. European Journal of Operational Research.
  16. Powell, W. B. 2007. Approximate Dynamic Programming: Solving the curses of dimensionality, volume 703. John Wiley & Sons.
  17. Quantifying the benefits of vehicle pooling with shareability networks. Proceedings of the National Academy of Sciences, 111(37): 13290–13294.
  18. Neural Approximate Dynamic Programming for On-Demand Ride-Pooling. In The Thirty-Fourth AAAI Conference on Artificial Intelligence, 507–515. AAAI Press.
  19. Joint Pricing and Matching for City-Scale Ride-Pooling. Proceedings of the International Conference on Automated Planning and Scheduling, 32(1): 499–507.
  20. Uber. 2018. Uber Matching Solution. https://marketplace.uber.com/matching. Accessed: 2021-12-04.
  21. Large-Scale Order Dispatch in On-Demand Ride-Hailing Platforms: A Learning and Planning Approach. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ’18, 905–913.
  22. Dynamic pricing and matching in ride-hailing platforms. Naval Research Logistics (NRL), 67(8): 705–724.
  23. Mean Field Multi-Agent Reinforcement Learning. In Proceedings of the 35th International Conference on Machine Learning (ICML), volume 80, 5571–5580.
  24. Order dispatch in price-aware ridesharing. Proceedings of the VLDB Endowment, 11(8): 853–865.
  25. Özkan, E. 2020. Joint pricing and matching in ride-sharing systems. European Journal of Operational Research, 287(3): 1149–1160.
Citations (3)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now