Please use this identifier to cite or link to this item:
http://arks.princeton.edu/ark:/88435/dsp016m311s144
Title: | Bike-Sharing System: Demand Prediction and System Expansion |
Authors: | Nitayanont, Tor |
Advisors: | Ahmadi, Amir Ali |
Department: | Operations Research and Financial Engineering |
Class Year: | 2019 |
Abstract: | The goal of this thesis is to first, predict bike demand of Citi Bike’s passengers in the New York City, and second, find the optimal locations to place additional bike stations for different purposes. We divide this work into four main steps: data decensoring, demand prediction, search for the spots to put bike stations and experiments. Regarding data decensoring, we apply the method developed earlier by other works and modify it so that it works well with our data. In the second step, we build several polynomial regression models to predict bike demand throughout Manhattan. We apply the concept of Voronoi diagram to spread demand observed at stations to their neighborhoods. It involves many methodologies that we come up with to make the regressions suitable for the nature of bike-sharing system and the habits of bike passengers. In order to select the locations to build bike stations, we propose a greedy method to add bike stations into the system one by one. Finally, we perform simulations of this bike-sharing system after we add bike stations at the locations suggested from earlier parts, assuming that arrival processes at bike stations follow Poisson processes. We count the number of out-of-stock events as well as the length of time periods when bike stations run out of spaces or bikes. |
URI: | http://arks.princeton.edu/ark:/88435/dsp016m311s144 |
Type of Material: | Princeton University Senior Theses |
Language: | en |
Appears in Collections: | Operations Research and Financial Engineering, 2000-2019 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
NITAYANONT-TOR-THESIS.pdf | 3.85 MB | Adobe PDF | Request a copy |
Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.