JavaScript is disabled for your browser. Some features of this site may not work without it.
eCommons will become read-only at noon on May 26 for an infrastructure update. Submissions will not be accepted at this time. We anticipate that this update will be completed by June 2 at 5 p.m.
Please contact us at ecommons-admin@cornell.edu if you have questions or concerns.
LIMIT THEOREMS IN QUEUEING NETWORKS WITH APPLICATIONS TO SHARED MOBILITY AND HEALTHCARE
dc.contributor.author | Tao, Shuang | |
dc.date.accessioned | 2020-08-10T20:23:29Z | |
dc.date.available | 2020-08-10T20:23:29Z | |
dc.date.issued | 2020-05 | |
dc.identifier.other | Tao_cornellgrad_0058F_12031 | |
dc.identifier.other | http://dissertations.umi.com/cornellgrad:12031 | |
dc.identifier.uri | https://hdl.handle.net/1813/70339 | |
dc.description | 314 pages | |
dc.description | Supplemental file(s) description: bike distribution with minimum choice function, bike distribution with exponential choice function. | |
dc.description.abstract | Queueing problems arise commonly in transportation and healthcare systems. With the immense popularity of shared mobility in recent years, there has been an increase in research interests on studying how such systems work from a queueing perspective and how to design policies to improve the system performance. In this thesis, we construct different Markovian queueing models and derive limit theorems for their empirical processes to study large scale dynamics of bike sharing, e-scooter sharing and healthcare systems. We also explore how different factors impact their system performance. First, we propose a stochastic model for bike sharing system with finite station capacity and non-stationary arrivals. In addition, we examine the power of information by extending the model to incorporate choice modeling where customers have higher probability of going to stations with more bikes. Then, we study the power of patient flexibility in the healthcare setting, and propose a model where a fraction p of all patients are flexible via joining the shortest of d queues, while the remaining 1-p only join the queue of their choice. Finally, we propose a model for e-scooter sharing that captures the battery life dynamics of a large scooter network. We prove a series of mean field limits and central limit theorem results for the empirical measure process of these queueing models, which provide insights on the mean, variance, and sample path dynamics of such large scale systems. We also show that an interchanging of limits result holds for both the mean field limit and the diffusion limit for some models. The analysis presented in this thesis gives an analytical framework for providing estimations of important performance measures of these stochastic systems and their confidence intervals. It also helps quantify the impact of information and flexibility. All of the above has the potential to inform better operations and designs of future systems in shared mobility and healthcare. | |
dc.language.iso | en | |
dc.rights | Attribution 4.0 International | |
dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | |
dc.subject | diffusion limit | |
dc.subject | fluid limit | |
dc.subject | healthcare | |
dc.subject | queueing systems | |
dc.subject | shared transportation | |
dc.title | LIMIT THEOREMS IN QUEUEING NETWORKS WITH APPLICATIONS TO SHARED MOBILITY AND HEALTHCARE | |
dc.type | dissertation or thesis | |
thesis.degree.discipline | Operations Research and Information Engineering | |
thesis.degree.grantor | Cornell University | |
thesis.degree.level | Doctor of Philosophy | |
thesis.degree.name | Ph. D., Operations Research and Information Engineering | |
dc.contributor.chair | Pender, Jamol | |
dc.contributor.committeeMember | Chen, Yudong | |
dc.contributor.committeeMember | Henderson, Shane | |
dc.description.viewer | 1_ol6l7gvi | |
dc.description.viewer | 1_45fd39i2 | |
dcterms.license | https://hdl.handle.net/1813/59810 | |
dc.identifier.doi | https://doi.org/10.7298/hmp6-p563 |
Files in this item
This item appears in the following Collection(s)
Except where otherwise noted, this item's license is described as Attribution 4.0 International