A stochastic optimization model for transit network timetable design to mitigate the randomness of traveling time by adding slack time

Transit network timetabling aims at determining the departure time of each trip of all lines in order to facilitate passengers transferring either to or from a bus. In this paper, we consider a bus timetabling problem with stochastic travel times (BTP-STT). Slack time is added into timetable to mitigate the randomness in bus travel times. We then develop a stochastic integer programming model for the BTP-STT to minimize the total waiting time cost for three types of passengers (i.e., transferring passengers, boarding passengers and through passengers). The mathematical properties of the model are characterized. Due to its computational complexity, a genetic algorithm with local search (GALS) is designed to solve our proposed model (OPM). The numerical results based on a small bus network show that the timetable obtained from OPM reduces the total waiting time cost by an average of 9.5%, when it is tested in different scenarios. OPM is relatively effective if the ratio of the number of through passengers to the number of transferring passengers is not larger than a threshold (e.g., 10 in our case). In addition, we test different scale instances randomly generated in a practical setting to further verify the effectiveness of OPM and GALS. We also find that adding slack time into timetable greatly benefits transferring passengers by reducing the rate of transferring failure.     

Joint leisure travel optimization with user-generated data via perceived utility maximization

The lack of personalized solutions for managing the demand of joint leisure trips in cities in real time hinders the optimization of transportation system operations. Joint leisure activities can account for up to 60% of trips in cities and unlike fixed trips (i.e., trips to work where the arrival time and the trip destination are predefined), leisure activities offer more optimization flexibility since the activity destination and the arrival times of individuals can vary.To address this problem, a perceived utility model derived from non-traditional data such as smartphones/social media for representing users’ willingness to travel a certain distance for participating in leisure activities at different times of day is presented. Then, a stochastic annealing search method for addressing the exponential complexity optimization problem is introduced. The stochastic annealing method suggests the preferred location of a joint leisure activity and the arrival times of individuals based on the users’ preferences derived from the perceived utility model. Test-case implementations of the approach used 14-month social media data from London and showcased an increase of up to 3 times at individuals’ satisfaction while the computational complexity is reduced to almost linear time serving the real-time implementation requirements.     

From traces to trajectories: How well can we guess activity locations from mobile phone traces?

Passively generated mobile phone dataset is emerging as a new data source for research in human mobility patterns. Information on individuals’ trajectories is not directly available from such data; they must be inferred. Many questions remain in terms how well we can capture human mobility patterns from these datasets. Only one study has compared the results from a mobile phone dataset to those from the National Household Travel Survey (NHTS), though the comparison is on two different populations and samples. This study is a very first attempt that develops a procedure to generate a simulated mobile phone dataset containing the ground truth information. This procedure can be used by other researchers and practitioners who are interested in using mobile phone data and want to formally evaluate the effectiveness of an algorithm.To identify activity locations from mobile phone traces, we develop an ensemble of methods: a model-based clustering method to identify clusters, a logistic regression model to distinguish between activity and travel clusters, and a set of behavior-based algorithms to detect types of locations visited. We show that the distribution of the activity locations identified from the simulated mobile phone dataset resembles the ground truth better than the existing studies. For home locations, 70% and 97% of identified homes are within 100 and 1000 m from the truth, respectively. For work places, 65% and 86% of the identified work places are within 100 and 1000 m from the true ones, respectively. These results point to the possibility of using these passively generated mobile phone datasets to supplement or even replace household travel surveys in transportation planning in the future.     

Floating car based travel times for city logistics

City logistics routing requires time-dependent travel times for each network link. We rely on the concept of Floating Car Data (FCD) to develop and provide such travel times. Different levels of aggregation in the determination of time-dependent travel times from a database of historical FCD are presented and evaluated with regard to routing quality. Furthermore, a Data Mining approach is introduced, allowing for a substantial reduction of the volume of input data required for city logistics routing. The different approaches are investigated and evaluated by a huge amount of FCD collected for the urban area of Stuttgart, Germany. The results show that the Data Mining approach enables efficient provision of time-dependent travel times without a significant loss of routing quality for city logistics applications.     

Over-reporting vs. overreacting: Commuters’ perceptions of travel times

In a large-scale, real-life peak avoidance experiment, we asked participants to provide estimates of their average in-vehicle travel time during their morning commute. After comparing the reported travel times with the actual corresponding travel times, we found that the average travel times were overstated by a factor of 1.5. We showed that driver- and link-specific characteristics partially explained these exaggerations. Using the stated and revealed preference data, we investigated whether the driver-specific reporting errors were consistent with the drivers’ scheduling behaviors in reality and in hypothetical choice experiments. In both cases, we found no robust evidence that drivers behave as if they misperceive travel times to a similar extent as those they misreported, thereby implying that the reported travel times did not represent the actual or perceived travel times in a truthful manner. The results of this study suggest that caution should be recommended when reported travel time data are used in an uncritical manner during transport research and when determining policy.     

Application of Lagrangian relaxation approach to α-reliable path finding in stochastic networks with correlated link travel times

This study investigates the important problem of determining a reliable path in a stochastic network with correlated link travel times. First, the distribution of path travel time is quantified by using trip records from GPS probe vehicles. Second, the spatial correlation of link travel time is explicitly considered by using a correlation coefficient matrix, which is incorporated into the α-reliable path problem by Cholesky decomposition. Third, the Lagrangian relaxation based framework is used to handle the α-reliable path problem, by which the intractable problem with a non-linear and non-additive structure can be decomposed into several easy-to-solve problems. Finally, the path-finding performance of this approach is tested on a real-world network. The results show that 15 iterations of calculation can yield a small relative gap between upper and lower bounds of the optimal solution and the average running time is about 5 s for most OD settings. The applicability of α-reliable path finding is validated by a case study.     

A bayesian dynamic linear model approach for real-time short-term freeway travel time prediction

This paper presents a Bayesian inference-based dynamic linear model (DLM) to predict online short-term travel time on a freeway stretch. The proposed method considers the predicted freeway travel time as the sum of the median of historical travel times, time-varying random variations in travel time, and a model evolution error, where the median is employed to recognize the primary travel time pattern while the variation captures unexpected supply (i.e. capacity) reduction and demand fluctuations. Bayesian forecasting is a learning process that revises sequentially the state of a priori knowledge of travel time based on newly available information. The prediction result is a posterior travel time distribution that can be employed to generate a single-value (typically but not necessarily the mean) travel time as well as a confidence interval representing the uncertainty of travel time prediction. To better track travel time fluctuations during non-recurrent congestion due to unforeseen events (e.g., incidents, accidents, or bad weather), the DLM is integrated into an adaptive control framework that can automatically learn and adjust the system evolution noise level. The experiment results based on the real loop detector data of an I-66 segment in Northern Virginia suggest that the proposed method is able to provide accurate and reliable travel time prediction under both recurrent and non-recurrent traffic conditions.