Analysis of On-Demand Ride-Hailing Systems

Thumbnail Image

Persistent link to this item

View Statistics

Journal Title

Journal ISSN

Volume Title


Analysis of On-Demand Ride-Hailing Systems

Published Date




Thesis or Dissertation


Recently, there has been a rapid rise of on-demand ride-hailing platforms, such as Uber and Didi, which allow passengers with smartphones to submit trip requests and match them to drivers based on their locations and drivers availability. This increased demand has raised questions about how such a new matching mechanism will affect the efficiency of a transportation system, in particular, whether it will help reduce passengers average waiting time compared to traditional street-hailing systems. In this dissertation, we address this question by building a stylized model of a circular road and comparing the average waiting times of passengers under various matching mechanisms. After identifying key tradeoffs between different mechanisms, we find that surprisingly, the on-demand matching mechanism could result in higher or lower efficiency than the traditional street-hailing mechanism, depending on the parameters of the system. To overcome the disadvantage of both systems, we further propose adding response caps to the on-demand hailing mechanism and develop a heuristic method to calculate a near-optimal cap. We also test our model using more complex road networks as well as more general scenarios to show that our key observations still exist.



University of Minnesota Ph.D. dissertation. October 2018. Major: Industrial Engineering. Advisor: Zizhuo Wang. 1 computer file (PDF); ix, 84 pages.

Related to




Series/Report Number

Funding information

Isbn identifier

Doi identifier

Previously Published Citation

Suggested citation

Feng, Guiyun. (2018). Analysis of On-Demand Ride-Hailing Systems. Retrieved from the University Digital Conservancy,

Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.