arXiv subjects

Baichuan Mo

Publications and source records attributed to Baichuan Mo.

28 records · Page 2Linked to original sources

arXiv2023

Modeling Virus Transmission Risks in Commuting with Emerging Mobility Services: A Case Study of COVID-19

Commuting is an important part of daily life. With the gradual recovery from COVID-19 and more people returning to work from the office, the transmission of COVID-19 during commuting becomes a concern. Recent emerging mobility services (such as ride-hailing and bike-sharing) further deteriorate the infection risks due to shared vehicles or spaces during travel. Hence, it is important to quantify the infection risks in commuting. This paper proposes a probabilistic framework to estimate the risk of infection during an individual's commute considering different travel modes, including public transit, ride-share, bike, and walking. The objective is to evaluate the probability of infection as well as the estimation errors (i.e., uncertainty quantification) given the origin-destination (OD), departure time, and travel mode. We first define a general trip planning function to generate trip trajectories and probabilities of choosing different paths according to the OD, departure time, and travel mode. Then, we consider two channels of infections: 1) infection by close contact and 2) infection by touching surfaces. The infection risks are calculated on a trip segment basis. Different sources of data (such as smart card data, travel surveys, and population data) are used to estimate the potential interactions between the individual and the infectious environment. The model is implemented in the MIT community as a case study. We evaluate the commute infection risks for employees and students. Results show that most of the individuals have an infection probability close to zero. The maximum infection probability is around 0.8%, implying that the probability of getting infected during the commuting process is low. Individuals with larger travel distances, traveling in transit, and traveling during peak hours are more likely to get infected.

stat.AP↗

arXiv2022

Calibrating Path Choices and Train Capacities for Urban Rail Transit Simulation Models Using Smart Card and Train Movement Data

Transit network simulation models are often used for performance and retrospective analysis of urban rail systems, taking advantage of the availability of extensive automated fare collection (AFC) and automated vehicle location (AVL) data. Important inputs to such models, in addition to origin-destination flows, include passenger path choices and train capacity. Train capacity, which has often been overlooked in the literature, is an important input that exhibits a lot of variabilities. The paper proposes a simulation-based optimization (SBO) framework to simultaneously calibrate path choices and train capacity for urban rail systems using AFC and AVL data. The calibration is formulated as an optimization problem with a black-box objective function. Seven algorithms from four branches of SBO solving methods are evaluated. The algorithms are evaluated using an experimental design that includes five scenarios, representing different degrees of path choice randomness and crowding sensitivity. Data from the Hong Kong Mass Transit Railway (MTR) system is used as a case study. The data is used to generate synthetic observations used as "ground truth". The results show that the response surface methods (particularly Constrained Optimization using Response Surfaces) have consistently good performance under all scenarios. The proposed approach drives large-scale simulation applications for monitoring and planning.

cs.OH↗

arXiv2022

Transit Frequency Setting Problem with Demand Uncertainty

Public transit systems are the backbone of urban mobility systems in the era of urbanization. The design of transit schedules is important for the efficient and sustainable operation of public transit. However, previous studies usually assume fixed demand patterns and ignore uncertainties in demand, which may generate transit schedules that are vulnerable to demand variations. To address demand uncertainty issues inherent in public transit systems, this paper adopts both stochastic programming (SP) and robust optimization (RO) techniques to generate robust transit schedules against demand uncertainty. A nominal (non-robust) optimization model for the transit frequency setting problem (TFSP) under a single transit line setting is first proposed. The model is then extended to SP-based and RO-based formulations to incorporate demand uncertainty. The large-scale origin-destination (OD) matrices for real-world transit problems make the optimization problems hard to solve. To efficiently generate robust transit schedules, a Transit Downsizing (TD) approach is proposed to reduce the dimensionality of the problem. We prove that the optimal objective function of the problem after TD is close to that of the original problem (i.e., the difference is bounded from above). The proposed models are tested with real-world transit lines and data from the Chicago Transit Authority (CTA). Compared to the current transit schedule implemented by CTA, the nominal TFSP model without considering demand uncertainty reduces passengers' wait times while increasing in-vehicle travel times. After incorporating demand uncertainty, both stochastic and robust TFSP models reduce passengers' wait times and in-vehicle travel times simultaneously. The robust TFSP model produces transit schedules with better in-vehicle travel times and worse wait times for passengers compared to the stochastic TFSP model.

math.OC↗

arXiv2022

Impact of unplanned service disruptions on urban public transit systems

This paper proposes a general unplanned incident analysis framework for public transit systems from the supply and demand sides using automated fare collection (AFC) and automated vehicle location (AVL) data. Specifically, on the supply side, we propose an incident-based network redundancy index to analyze the network's ability to provide alternative services under a specific rail disruption. The impacts on operations are analyzed through the headway changes. On the demand side, the analysis takes place at two levels: aggregate flows and individual response. We calculate the demand changes of different rail lines, rail stations, bus routes, and bus stops to better understand the passenger flow redistribution under incidents. Individual behavior is analyzed using a binary logit model based on inferred passengers' mode choices and socio-demographics using AFC data. The public transit system of the Chicago Transit Authority is used as a case study. Two rail disruption cases are analyzed, one with high network redundancy around the impacted stations and the other with low. Results show that the service frequency of the incident line was largely reduced (by around 30% ~ 70%) during the incident time. Nearby rail lines with substitutional functions were also slightly affected. Passengers showed different behavioral responses in the two incident scenarios. In the low redundancy case, most of the passengers chose to use nearby buses to move, either to their destinations or to the nearby rail lines. In the high redundancy case, most of the passengers transferred directly to nearby lines. Corresponding policy implications and operating suggestions are discussed.

stat.AP↗

arXiv2021

Deep Neural Networks for Choice Analysis: Architectural Design with Alternative-Specific Utility Functions

Whereas deep neural network (DNN) is increasingly applied to choice analysis, it is challenging to reconcile domain-specific behavioral knowledge with generic-purpose DNN, to improve DNN's interpretability and predictive power, and to identify effective regularization methods for specific tasks. This study designs a particular DNN architecture with alternative-specific utility functions (ASU-DNN) by using prior behavioral knowledge. Unlike a fully connected DNN (F-DNN), which computes the utility value of an alternative k by using the attributes of all the alternatives, ASU-DNN computes it by using only k's own attributes. Theoretically, ASU-DNN can dramatically reduce the estimation error of F-DNN because of its lighter architecture and sparser connectivity. Empirically, ASU-DNN has 2-3% higher prediction accuracy than F-DNN over the whole hyperparameter space in a private dataset that we collected in Singapore and a public dataset in R mlogit package. The alternative-specific connectivity constraint, as a domain-knowledge-based regularization method, is more effective than the most popular generic-purpose explicit and implicit regularization methods and architectural hyperparameters. ASU-DNN is also more interpretable because it provides a more regular substitution pattern of travel mode choices than F-DNN does. The comparison between ASU-DNN and F-DNN can also aid in testing the behavioral knowledge. Our results reveal that individuals are more likely to compute utility by using an alternative's own attributes, supporting the long-standing practice in choice modeling. Overall, this study demonstrates that prior behavioral knowledge could be used to guide the architecture design of DNN, to function as an effective domain-knowledge-based regularization method, and to improve both the interpretability and predictive power of DNN in choice analysis.

cs.LG↗

arXiv2021

Competition between shared autonomous vehicles and public transit: A case study in Singapore

Emerging autonomous vehicles (AV) can either supplement the public transportation (PT) system or compete with it. This study examines the competitive perspective where both AV and PT operators are profit-oriented with dynamic adjustable supply strategies under five regulatory structures regarding whether the AV operator is allowed to change the fleet size and whether the PT operator is allowed to adjust headway. Four out of the five scenarios are constrained competition while the other one focuses on unconstrained competition to find the Nash Equilibrium. We evaluate the competition process as well as the system performance from the standpoints of four stakeholders -- the AV operator, the PT operator, passengers, and the transport authority. We also examine the impact of PT subsidies on the competition results including both demand-based and supply-based subsidies. A heuristic algorithm is proposed to update supply strategies for AV and PT based on the operators' historical actions and profits. An agent-based simulation model is implemented in the first-mile scenario in Tampines, Singapore. We find that the competition can result in higher profits and higher system efficiency for both operators compared to the status quo. After the supply updates, the PT services are spatially concentrated to shorter routes feeding directly to the subway station and temporally concentrated to peak hours. On average, the competition reduces the travel time of passengers but increases their travel costs. Nonetheless, the generalized travel cost is reduced when incorporating the value of time. With respect to the system efficiency, the bus supply adjustment increases the average vehicle load and reduces the total vehicle kilometer traveled measured by the passenger car equivalent (PCE), while the AV supply adjustment does the opposite.

physics.soc-ph↗

arXiv2021

Individual Mobility Prediction: An Interpretable Activity-based Hidden Markov Approach

Individual mobility is driven by demand for activities with diverse spatiotemporal patterns, but existing methods for mobility prediction often overlook the underlying activity patterns. To address this issue, this study develops an activity-based modeling framework for individual mobility prediction. Specifically, an input-output hidden Markov model (IOHMM) framework is proposed to simultaneously predict the (continuous) time and (discrete) location of an individual's next trip using transit smart card data. The prediction task can be transformed into predicting the hidden activity duration and end location. Based on a case study of Hong Kong's metro system, we show that the proposed model can achieve similar prediction performance as the state-of-the-art long short-term memory (LSTM) model. Unlike LSTM, the proposed IOHMM model can also be used to analyze hidden activity patterns, which provides meaningful behavioral interpretation for why an individual makes a certain trip. Therefore, the activity-based prediction framework offers a way to preserve the predictive power of advanced machine learning methods while enhancing our ability to generate insightful behavioral explanations, which is useful for enhancing situational awareness in user-centric transportation applications such as personalized traveler information.

cs.LG↗

arXiv2020

Modeling Epidemic Spreading through Public Transit using Time-Varying Encounter Network

Passenger contact in public transit (PT) networks can be a key mediate in the spreading of infectious diseases. This paper proposes a time-varying weighted PT encounter network to model the spreading of infectious diseases through the PT systems. Social activity contacts at both local and global levels are also considered. We select the epidemiological characteristics of coronavirus disease 2019 (COVID-19) as a case study along with smart card data from Singapore to illustrate the model at the metropolitan level. A scalable and lightweight theoretical framework is derived to capture the time-varying and heterogeneous network structures, which enables to solve the problem at the whole population level with low computational costs. Different control policies from both the public health side and the transportation side are evaluated. We find that people's preventative behavior is one of the most effective measures to control the spreading of epidemics. From the transportation side, partial closure of bus routes helps to slow down but cannot fully contain the spreading of epidemics. Identifying "influential passengers" using the smart card data and isolating them at an early stage can also effectively reduce the epidemic spreading.

physics.soc-ph↗

arXiv2020

Theory-based residual neural networks: A synergy of discrete choice models and deep neural networks

Researchers often treat data-driven and theory-driven models as two disparate or even conflicting methods in travel behavior analysis. However, the two methods are highly complementary because data-driven methods are more predictive but less interpretable and robust, while theory-driven methods are more interpretable and robust but less predictive. Using their complementary nature, this study designs a theory-based residual neural network (TB-ResNet) framework, which synergizes discrete choice models (DCMs) and deep neural networks (DNNs) based on their shared utility interpretation. The TB-ResNet framework is simple, as it uses a ($δ$, 1-$δ$) weighting to take advantage of DCMs' simplicity and DNNs' richness, and to prevent underfitting from the DCMs and overfitting from the DNNs. This framework is also flexible: three instances of TB-ResNets are designed based on multinomial logit model (MNL-ResNets), prospect theory (PT-ResNets), and hyperbolic discounting (HD-ResNets), which are tested on three data sets. Compared to pure DCMs, the TB-ResNets provide greater prediction accuracy and reveal a richer set of behavioral mechanisms owing to the utility function augmented by the DNN component in the TB-ResNets. Compared to pure DNNs, the TB-ResNets can modestly improve prediction and significantly improve interpretation and robustness, because the DCM component in the TB-ResNets stabilizes the utility functions and input gradients. Overall, this study demonstrates that it is both feasible and desirable to synergize DCMs and DNNs by combining their utility specifications under a TB-ResNet framework. Although some limitations remain, this TB-ResNet framework is an important first step to create mutual benefits between DCMs and DNNs for travel behavior modeling, with joint improvement in prediction, interpretation, and robustness.

cs.LG↗

arXiv2020

Assignment-based Path Choice Estimation for Metro Systems Using Smart Card Data

Urban rail services are the principal means of public transportation in many cities. To understand the crowding patterns and develop efficient operation strategies in the system, obtaining path choices is important. This paper proposed an assignment-based path choice estimation framework using automated fare collection (AFC) data. The framework captures the inherent correlation of crowding among stations, as well as the interaction between path choice and left behind. The path choice estimation is formulated as an optimization problem. The original problem is intractable because of a non-analytical constraint and a non-linear equation constraint. A solution procedure is proposed to decompose the original problem into three tractable sub-problems, which can be solved efficiently. The model is validated using both synthetic data and real-world AFC data in Hong Kong Mass Transit Railway (MTR) system. The synthetic data test validates the model's effectiveness in estimating path choice parameters, which can outperform the purely simulation-based optimization methods in both accuracy and efficiency. The test results using actual data show that the estimated path shares are more reasonable than survey-derived path shares and uniform path shares. Model robustness in terms of different initial values and different case study dates are also verified.

cs.DS↗