Abstract
This paper develops a closed queueing network model of a ride-hailing system by viewing cars as the jobs moving through various nodes of the network perpetually. The queueing network model crucially incorporates the travel times between different nodes of the network. We prove a novel heavy-traffic limit theorem for this queueing network, providing an approximation for the original ride-hailing system.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call