We propose a methodology based on multiple automated data sources for evaluating the effects of station layout, arriving traveler flows, and platform and on-board crowding on the distribution of boarding passengers among individual cars of metro trains. The methodology is applied to a case study for a sequence of stations in the Stockholm metro network. The findings suggest that passengers opt for less crowded train cars in crowded situations, trading-off walking and in-vehicle crowding while waiting and riding. We find that the boarding car distribution is also affected by the locations of platform access points and the distribution of entering traveler flows. These insights may be used by transit planners and operators to increase the understanding of how passengers behave under varying crowding conditions, identify the factors that affect travelers' choice of metro car and eventually reduce experienced on-board crowding and increase the capacity utilization of the trains through investments in infrastructure or operational interventions.

City-wide travel time prediction in real-time is an important enabler for efficient use of the road network. It can be used in traveler information to enable more efficient routing of individual vehicles as well as decision support for traffic management applications such as directed information campaigns or incident management. 3D speed maps have been shown to be a promising methodology for revealing day-to-day regularities of city-level travel times and possibly also for short-term prediction. In this paper, we aim to further evaluate and benchmark the use of 3D speed maps for short-term travel time prediction and to enable scenario-based evaluation of traffic management actions we also evaluate the framework for traffic flow prediction. The 3D speed map methodology is adapted to short-term prediction and benchmarked against historical mean as well as against Probabilistic Principal Component Analysis (PPCA). The benchmarking and analysis are made using one year of travel time and traffic flow data for the city of Stockholm, Sweden. The result of the case study shows very promising results of the 3D speed map methodology for short-term prediction of both travel times and traffic flows. The modified version of the 3D speed map prediction outperforms the historical mean prediction as well as the PPCA method. Further work includes an extended evaluation of the method for different conditions in terms of underlying sensor infrastructure, preprocessing and spatio-temporal aggregation as well as benchmarking against other prediction methods.

Transportation networks are inherently uncertain due to random disruptions; meanwhile, real-time information potentially helps travelers adapt to realized traffic conditions and make better route choices under such disruptions. Modeling adaptive route choice behavior is essential in evaluating real-time traveler information systems and related policies. This research contributes to the state of the art by developing a latent-class routing policy choice model in a stochastic time-dependent network with revealed preference data. A routing policy is defined as a decision rule applied at each link that maps possible realized traffic conditions to decisions on the link to take next. It represents a traveler's ability to look ahead in order to incorporate real-time information not yet available at the time of decision. A case study is conducted in Stockholm, Sweden and data for the stochastic time-dependent network are generated from hired taxi Global Positioning System (GPS) readings. A latent-class Policy Size Logit model is specified, with routing policy users who follow routing policies and path users who follow fixed paths. Two additional layers of latency in the measurement equation are accounted for: 1) the choice of a routing policy is latent and only its realized path on a given day can be observed; and 2) when GPS readings have relatively long gaps, the realized path cannot be uniquely identified, and the likelihood of observing vehicle traces with non-consecutive links is instead maximized. Routing policy choice set generation is based on the generalization of path choice set generation methods. The generated choice sets achieve 95% coverage for 100% overlap threshold after correcting GPS mistakes and breaking up trips with intermediate stops, and further achieve 100% coverage for 90% overlap threshold. Estimation results show that the routing policy user class probability increases with trip length, and the latent-class routing policy choice model fits the data better than a single-class path choice or routing policy choice model. This suggests that travelers are heterogeneous in terms of their ability and/or willingness to plan ahead and utilize real-time information, and an appropriate route choice model for uncertain networks should take into account the underlying stochastic travel times and structured traveler heterogeneity in terms of real-time information utilization.

Tunnel congestion is an important safety problem and is often dealt with using disruptive traffic management strategies, such as closures. The paper proposes an approach to identify the underlying causes of recurrent congestion in tunnels and tests the hypothesis that the cause may vary from day to day. It also suggests that the appropriate tunnel management strategy to deploy depends on the cause. Utilizing traffic sensor data the approach consists of: (i) cluster analysis of historical traffic data to identify distinct congestion patterns; (ii) in-depth analysis of the underlying demand patterns and associated bottlenecks; (iii) simulation to evaluate alternative strategies for each demand pattern; (iv) on-line classification analysis which is able to identify, in real time, the emerging congestion pattern, and inform the type of mitigation strategy to be implemented. The methodology is demonstrated for a congested tunnel in Stockholm, Sweden revealing two different spatio-temporal congestion patterns. The results show that, if the current strategy of closures is to be used, the timing should depend on the congestion pattern. However, metering is the most promising strategy. The on-line classification of the emerging congestion pattern is effective and can inform appropriate strategy proactively. The analysis emphasizes that the effectiveness of tunnel traffic management can be increased by identifying the causes of congestion on a given day.

Automation technology is expected to change the public transport sector radically in the future. One rising issue is whether to embrace the intermediate stage of semi-autonomous buses or to wait until fully autonomous buses are available. This paper proposes a cost model of bus operations considering automation technology. The generalized cost, which is the sum of waiting, riding, operating, and capital cost, is modeled for conventional, semi-autonomous, and fully autonomous bus services on a generic trunk-and-branches network. Semi-autonomous buses achieve reduced unit operating cost through automated platooning on the corridor. The relative efficiency of the different services is studied under a range of scenarios for commercial speed, network structure, and demand distribution. Analytical and numerical results show that fully autonomous buses exhibit great potential through reduced operating and waiting costs even if the additional capital cost is high. The advantages of semi-autonomous buses are weaker and most prominent in networks with low demand along a long corridor such as interurban networks. For both automation levels a commercial speed comparable to conventional vehicles is crucial. The established criteria provide input to planners and operators for understanding the potential of automated bus services.

In transit corridors, multiple lines share a sequence of consecutive stops to provide higher joint frequency in higher demand areas. A key challenge is to coordinate the transition from single line to joint operation. A holding control strategy aimed at minimizing passenger travel times is introduced for lines merging into a shared corridor, accounting for the coordination of vehicle arrivals from the merging lines as well as the regularity of each line. The criterion is tested using an artificial network and a real-world network to analyze the impact of demand distribution and compare cooperative versus single line control. We illustrate how the real-time strategy yields overall passenger gains, depending on the composition of different user groups. Results are assessed based on operation and passenger performance indicators and show that coordination is achieved. When combined with joint control in the common part, the proposed approach achieves consistent network-wide travel time benefits.

Disruptions in public transport networks (PTNs) often lead to partial capacity reductions rather than complete closures. This study aims to move beyond the vulnerability analysis of complete failures by investigating the impacts of a range of capacity reductions on PTN performance. The relation between network performance and the degradation of line or link capacities is investigated by establishing a vulnerability curve and related metrics. The analysis framework is applied to a full-scan analysis of planned temporary line-level capacity reductions and an analysis of unplanned link-level capacity reductions on the most central segments in the multi-modal rapid PTN of Stockholm, Sweden. The impacts of capacity reductions are assessed using a non-equilibrium dynamic public transport operations and assignment model. The nonlinear properties of on-board crowding, denied boarding, network effects and route choice result in non-trivial, generally convex, relations which carry implications on disruption planning and real-time management.

Massive data broadcast by GPS-equipped vehicles provide unprecedented opportunities. One of the main tasks in order to optimize our transportation networks is to build data-driven real-time decision support systems. However, the dynamic environments where the networks operate disallow the traditional assumptions required to put in practice many off-the-shelf supervised learning algorithms, such as finite training sets or stationary distributions. In this paper, we propose BRIGHT: a drift-aware supervised learning framework to predict demand quantities. BRIGHT aims to provide accurate predictions for short-term horizons through a creative ensemble of time series analysis methods that handles distinct types of concept drift. By selecting neighborhoods dynamically, BRIGHT reduces the likelihood of overfitting. By ensuring diversity among the base learners, BRIGHT ensures a high reduction of variance while keeping bias stable. Experiments were conducted using three large-scale heterogeneous real-world transportation networks in Porto (Portugal), Shanghai (China) and Stockholm (Sweden), as well as controlled experiments using synthetic data where multiple distinct drifts were artificially induced. The obtained results illustrate the advantages of BRIGHT in relation to state-of-the-art methods for this task. 

The paper formulates the car-specific metro train crowding prediction problem based on real-time load data and evaluates the performance of several prediction methods (stepwise regression, lasso, and boosted tree ensembles). The problem is studied for multiple stations along a metro line in Stockholm, Sweden. Prediction accuracy is evaluated with respect to absolute passenger loads and predefined discrete crowding levels. When available, predictions with real-time load data significantly outperform historical averages, with accuracy improvements varying in magnitude across target stations and prediction horizons.