Urban public transit planning is crucial in reducing traffic congestion and enabling green transportation. However, there is no systematic way to integrate passengers' personal preferences in planning public transit routes and schedules so as to achieve high occupancy rates and efficiency gain of ride-sharing. In this paper, we take the first step tp exact passengers' preferences in planning from history public transit data. We propose a data-driven method to construct a Markov decision process model that characterizes the process of passengers making sequential public transit choices, in bus routes, subway lines, and transfer stops/stations. Using the model, we integrate softmax policy iteration into maximum entropy inverse reinforcement learning to infer the passenger's reward function from observed trajectory data. The inferred reward function will enable an urban planner to predict passengers' route planning decisions given some proposed transit plans, for example, opening a new bus route or subway line. Finally, we demonstrate the correctness and accuracy of our modeling and inference methods in a large-scale (three months) passenger-level public transit trajectory data from Shenzhen, China. Our method contributes to smart transportation design and human-centric urban planning.
more »
« less
Human-Centric Urban Transit Evaluation and Planning
Public transits, such as buses and subway lines, offer affordable ride-sharing services and reduce the road network traffic, thus have significant impacts in mitigating the urban traffic congestion problem. However, it is non-trivial to evaluate a new transit plan, such as a new bus route or a new subway line, of its future ridership prior to actual deployment, since the travel preferences of passengers along the planned routes may vary. In this paper, we make the first attempt to model passengers' preferences of making various transit choices using a Markov Decision Process (MDP). Moreover, we develop a novel inverse preference learning algorithm to infer the passengers' preferences and predict the future human behavior changes, e.g., ridership, of a new urban transit plan before its deployment. We validate our proposed framework using a unique real-world dataset (from Shenzhen, China) with three subway lines opened during the data time span. With the data collected from both before and after the transit plan deployments, Our evaluation results demonstrated that the proposed framework can predict the ridership with only 19.8% relative error, which is 23%-51% lower than other baseline approaches.
more »
« less
- Award ID(s):
- 1657350
- NSF-PAR ID:
- 10098197
- Date Published:
- Journal Name:
- 2018 IEEE International Conference on Data Mining (ICDM)
- Page Range / eLocation ID:
- 547 to 556
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
The ability to accurately predict public transit ridership demand benefits passengers and transit agencies. Agencies will be able to reallocate buses to handle under or over-utilized bus routes, improving resource utilization, and passengers will be able to adjust and plan their schedules to avoid overcrowded buses and maintain a certain level of comfort. However, accurately predicting occupancy is a non-trivial task. Various reasons such as heterogeneity, evolving ridership patterns, exogenous events like weather, and other stochastic variables, make the task much more challenging. With the progress of big data, transit authorities now have access to real-time passenger occupancy information for their vehicles. The amount of data generated is staggering. While there is no shortage in data, it must still be cleaned, processed, augmented, and merged before any useful information can be generated. In this paper, we propose the use and fusion of data from multiple sources, cleaned, processed, and merged together, for use in training machine learning models to predict transit ridership. We use data that spans a 2-year period (2020-2022) incorporating transit, weather, traffic, and calendar data. The resulting data, which equates to 17 million observations, is used to train separate models for the trip and stop level prediction. We evaluate our approach on real-world transit data provided by the public transit agency of Nashville, TN. We demonstrate that the trip level model based on Xgboost and the stop level model based on LSTM outperform the baseline statistical model across the entire transit service day.more » « less
-
Searching for parking has been a problem faced by many drivers, especially in urban areas. With an increasing public demand for parking information and services, as well as the proliferation of advanced smartphones, a range of smartphone-based parking management services began to emerge. Funded by the National Science Foundation, our research aims to explore the potential of smartphone-based parking management services as a solution to parking problems, to deepen our understandings of travelers’ parking behaviors, and to further advance the analytical foundations and methodologies for modeling and assessing parking solutions. This paper summarizes progress and results from our research projects on smartphone-based parking management, including parking availability information prediction, parking searching strategy, the development of a mobile parking application, and our next steps to learn and discover new knowledge from its deployment. To predict future parking occupancy, we proposed a practical framework that integrates machine-learning techniques with a model-based core approach that explicitly models the stochastic parking process. The framework is able to predict future parking occupancy from historical occupancy data alone, and can handle complex arrival and departure patterns in real-world case studies, including special event. With the predicted probabilistic availability information, a cost-minimizing parking searching strategy is developed. The parking searching problem for an individual user is a stochastic Markov decision process and is formalized as a dynamic programming problem. The cost-minimizing parking searching strategy is solved by value iteration. Our simulated experiments showed that cost-minimizing strategy has the lowest expected cost but tends to direct a user to visit more parking facilities compared with two greedy strategies. Currently, we are working on implementing the predictive framework and the searching algorithm in a mobile phone application. We are working closely with Arizona State University (ASU) Parking and Transit Services to implement a three-stage pilot deployment of the prototype application around the ASU main campus. In the first stage, our application will provide real-time information and we will incorporate availability prediction and searching guidance in the second and third stages. Once the mobile application is deployed, it will provide unique opportunities to collect data on parking search behaviors, discover emerging scenarios of smartphone-based parking management services, and assess the impacts of such systems.more » « less
-
Searching for parking has been a problem faced by many drivers, especially in urban areas. With an increasing public demand for parking information and services, as well as the proliferation of advanced smartphones, a range of smartphone-based parking management services began to emerge. Funded by the National Science Foundation, our research aims to explore the potential of smartphone-based parking management services as a solution to parking problems, to deepen our understandings of travelers’ parking behaviors, and to further advance the analytical foundations and methodologies for modeling and assessing parking solutions. This paper summarizes progress and results from our research projects on smartphone-based parking management, including parking availability information prediction, parking searching strategy, the development of a mobile parking application, and our next steps to learn and discover new knowledge from its deployment. To predict future parking occupancy, we proposed a practical framework that integrates machine-learning techniques with a model-based core approach that explicitly models the stochastic parking process. The framework is able to predict future parking occupancy from historical occupancy data alone, and can handle complex arrival and departure patterns in real-world case studies, including special event. With the predicted probabilistic availability information, a cost-minimizing parking searching strategy is developed. The parking searching problem for an individual user is a stochastic Markov decision process and is formalized as a dynamic programming problem. The cost-minimizing parking searching strategy is solved by value iteration. Our simulated experiments showed that cost-minimizing strategy has the lowest expected cost but tends to direct a user to visit more parking facilities compared with two greedy strategies. Currently, we are working on implementing the predictive framework and the searching algorithm in a mobile phone application. We are working closely with Arizona State University (ASU) Parking and Transit Services to implement a three-stage pilot deployment of the prototype application around the ASU main campus. In the first stage, our application will provide real-time information and we will incorporate availability prediction and searching guidance in the second and third stages. Once the mobile application is deployed, it will provide unique opportunities to collect data on parking search behaviors, discover emerging scenarios of smartphone-based parking management services, and assess the impacts of such systems.more » « less
-
Rapid urbanization has posed significant burden on urban transportation infrastructures. In today's cities, both private and public transits have clear limitations to fulfill passengers' needs for quality of experience (QoE): Public transits operate along fixed routes with long wait time and total transit time; Private transits, such as taxis, private shuttles and ride-hailing services, provide point-to-point transits with high trip fare. In this paper, we propose CityLines, a transformative urban transit system, employing hybrid hub-and-spoke transit model with shared shuttles. Analogous to Airlines services, the proposed CityLines system routes urban trips among spokes through a few hubs or direct paths, with travel time as short as private transits and fare as low as public transits. CityLines allows both point-to-point connection to improve the passenger QoE, and hub-and-spoke connection to reduce the system operation cost. To evaluate the performance of CityLines, we conduct extensive data-driven experiments using one-month real-world trip demand data (from taxis, buses and subway trains) collected from Shenzhen, China. The results demonstrate that CityLines reduces 12.5%-44% average travel time, and aggregates 8.5%-32.6% more trips with ride-sharing over other implementation baselines.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- https://doi.org/10.1109/ICDM.2018.00070
