| LDR | | 00000nam u2200205 4500 |
| 001 | | 000000434698 |
| 005 | | 20200227094758 |
| 008 | | 200131s2019 ||||||||||||||||| ||eng d |
| 020 | |
▼a 9781687992451 |
| 035 | |
▼a (MiAaPQ)AAI27540379 |
| 040 | |
▼a MiAaPQ
▼c MiAaPQ
▼d 247004 |
| 082 | 0 |
▼a 620 |
| 100 | 1 |
▼a Swaszek, Rebecca . |
| 245 | 10 |
▼a Data-driven Fleet Load Balancing Strategies for Shared Mobility-on-demand Systems. |
| 260 | |
▼a [S.l.]:
▼b Boston University.,
▼c 2019. |
| 260 | 1 |
▼a Ann Arbor:
▼b ProQuest Dissertations & Theses,
▼c 2019. |
| 300 | |
▼a 114 p. |
| 500 | |
▼a Source: Dissertations Abstracts International, Volume: 81-05, Section: B. |
| 500 | |
▼a Advisor: Cassandras, Christos. |
| 502 | 1 |
▼a Thesis (Ph.D.)--Boston University, 2019. |
| 506 | |
▼a This item must not be sold to any third party vendors. |
| 520 | |
▼a Mobility on Demand (MoD) systems utilize shared vehicles to supplement or replace mass transit and private vehicles. Such systems include traditional taxis as well as Transportation Network Companies (TNCs) that offer bike and ride sharing. MoD systems face myriad operational challenges, but this dissertation focuses on the data-driven load balancing problem of redistributing vehicles among service regions. This is a difficult resource reallocation problem because customer demands follow a stochastic process subject to dynamic temporal-spatial patterns. The first half of this dissertation considers the load balancing problem for a bike sharing system in which bikes are redistributed among stations via trucks. The objective is to avoid situations in which a user wishes to rent (return) a bike to a station but cannot because the station is empty (full). First, a station and interval-specific inventory level is defined as a function of station capacity and interval demand rates as observed from analyzed data. Second, using a graph network framework, a receding horizon controller is proposed to determine the optimal paths -- over a short period of time -- for the fleet of trucks to take. When calculating the optimal paths the controller considers the current and projected inventory subject to the dynamically changing rent and return rates for every station in the network. The second half of this dissertation tackles the redistribution of an autonomous taxi fleet in which the vehicles themselves are capable of performing load balancing operations across service regions. The objective is to minimize the fraction of customers whose demands are dropped due to vehicle unavailability as well as the fraction of time the vehicles spend on load balancing operations (i.e driving empty). The system is represented by a queuing model and, as such, dynamic programming can find the optimal solution |
| 590 | |
▼a School code: 0017. |
| 650 | 4 |
▼a Engineering. |
| 690 | |
▼a 0537 |
| 710 | 20 |
▼a Boston University.
▼b Systems Engineering ENG. |
| 773 | 0 |
▼t Dissertations Abstracts International
▼g 81-05B. |
| 773 | |
▼t Dissertation Abstract International |
| 790 | |
▼a 0017 |
| 791 | |
▼a Ph.D. |
| 792 | |
▼a 2019 |
| 793 | |
▼a English |
| 856 | 40 |
▼u http://www.riss.kr/pdu/ddodLink.do?id=T15494400
▼n KERIS
▼z 이 자료의 원문은 한국교육학술정보원에서 제공합니다. |
| 980 | |
▼a 202002
▼f 2020 |
| 990 | |
▼a ***1008102 |
| 991 | |
▼a E-BOOK |