Assessing the financial and social costs of public transport in differing operating environments and with endogenous demand

This paper uses a previously developed spreadsheet cost model which simulates public transport modes operated on a 12-km route to analyse the total costs of different passenger demand levels. The previous cost model was a very powerful tool to estimate the social and operator costs for different public transport technologies. However, as the model is strategic, some basic assumptions were made which are relaxed in this paper. First, the speed-flow equation in the original spreadsheet model assumes that speed decreases according to the ratio of the current frequency and the lane capacity which is based on the safety headway without taking into account passenger boardings. However, this may vary in different operating environments. Therefore, the speed-flow equation is improved by moving from a linear equation to a piecewise equation that considers the features of different operating environments. Second, the model assumes that supply is sufficient to meet demand. However, when the level of demand is high for the lower-capacity public transport technologies, passengers may find the incoming vehicle full and therefore, they have to wait more than one service interval. This paper applies queuing theory to investigate the probability of having to wait longer than the expected service headways which will affect the average passenger waiting time. The extra waiting time for each passenger is calculated and applied in the spreadsheet cost model. Third, the original model assumed that demand was externally fixed (exogenous). To evaluate the differences after applying these equations, endogenous demand rather than exogenous demand will be investigated by using the elasticities for passenger waiting time and journey time.     

An equity‐based passenger flow control model with application to Hong Kong‐Shenzhen border‐crossing

Cross‐border passengers from Hong Kong to Shenzhen by the east Kowloon‐Canton Railway (KCR) through the Lo Wu customs exceed nearly 200 thousand on a special day such as a day during the Chinese Spring Festival. Such heavy passenger demand often exceeds the processing and holding capacity of the Lo Wu customs for many hours a day. Thus, passengers must be metered off at all entrance stations along the KCR line through ticket rationing to restrain the number of passengers waiting at Lo Wu within its safe holding capacity. This paper proposes an optimal control strategy and model to deal with this passenger crowding and control problem. Because the maximum passenger checkout rate at Lo Wu is fixed, total passenger waiting time is not affected by the control strategy for given time‐dependent arriving rates at each station. An equity‐based control strategy is thus proposed to equalize the waiting times of passengers arriving at all stations at the same time. This equity is achieved through optimal allocation of the total quota of tickets to all entrance stations for each train service. The total ticket quota for each train service is determined such that the capacity constraint of the passenger queue at Lo Wu is satisfied. The control problem is formulated as a successive linear programming problem and demonstrated for the KCR system with partially simulated data.     

Crowding in public transport systems: Effects on users,operation and implications for the estimation of demand

The effects of high passenger density at bus stops, at rail stations, inside buses and trains are diverse. This paper examines the multiple dimensions of passenger crowding related to public transport demand, supply and operations, including effects on operating speed, waiting time, travel time reliability, passengers’ wellbeing, valuation of waiting and in-vehicle time savings, route and bus choice, and optimal levels of frequency, vehicle size and fare. Secondly, crowding externalities are estimated for rail and bus services in Sydney, in order to show the impact of crowding on the estimated value of in-vehicle time savings and demand prediction. Using Multinomial Logit (MNL) and Error Components (EC) models, we show that alternative assumptions concerning the threshold load factor that triggers a crowding externality effect do have an influence on the value of travel time (VTTS) for low occupancy levels (all passengers sitting); however, for high occupancy levels, alternative crowding models estimate similar VTTS. Importantly, if demand for a public transport service is estimated without explicit consideration of crowding as a source of disutility for passengers, demand will be overestimated if the service is designed to have a number of standees beyond a threshold, as analytically shown using a MNL choice model. More research is needed to explore if these findings hold with more complex choice models and in other contexts.     

Passenger Perspectives in Railway Timetabling: A Literature Review

When looking at railway planning, a discrepancy exists between planners who focus on the train operations and publish fixed railway schedules, and passengers who look not only at the schedules but also at the entirety of their trip, from access to waiting to on-board travel and egress. Looking into this discrepancy is essential, as assessing railway performances by merely measuring train punctuality would provide an unfair picture of the level of service experienced by passengers. Firstly, passengers’ delays are often significantly larger than the train delays responsible for the passengers to be late. Secondly, trains’ punctuality is often strictly related to too tight schedules that in turn might translate into knock-on delays for longer dwelling times at stations, trip delays for increased risk of missing transfer connections, and uncertain assessment of the level of service experienced, especially with fluctuating passenger demand. A key aspect is the robustness of railway timetables. Empirical evidence indicates that passengers give more importance to travel time certainty than travel time reductions, as passengers associate an inherent disutility with travel time uncertainty. This disutility may be broadly interpreted as an anxiety cost for the need for having contingency plans in case of disruptions, and may be looked at as the motivator for the need for delay-robust railway timetables. Interestingly, passenger-oriented optimisation studies considering robustness in railway planning typically limit their emphasis on passengers to the consideration of transfer maintenance. Clearly, passengers’ travel behaviour is far more complex and multi-faceted and thus several other aspects should be considered, as becoming more and more evident from passenger surveys. The current literature review starts by looking at the parameters that railway optimisation/planning studies are focused on and the key performance indicators that impact railway planning. The attention then turns to the parameters influencing passengers’ perceptions and travel experiences. Finally, the review proposes guidelines on how to reduce the gap between the operators’ railway planning and performance measurement on the one hand and the passengers’ perception of the railway performance on the other hand. Thereby, the conclusions create a foundation for a more passenger-oriented railway timetabling ensuring that passengers are provided with the best service possible with the resources available.     

Analysis of real-time control strategies in a corridor with multiple bus services

Control strategies have been widely used in the literature to counteract the effects of bus bunching in passenger‘s waiting times and its variability. These strategies have only been studied for the case of a single bus line in a corridor. However, in many real cases this assumption does not hold. Indeed, there are many transit corridors with multiple bus lines interacting, and this interaction affects the efficiency of the implemented control mechanism.This work develops an optimization model capable of executing a control scheme based on holding strategy for a corridor with multiple bus lines.We analyzed the benefits in the level of service of the public transport system when considering a central operator who wants to maximize the level of service for users of all the bus lines, versus scenarios where each bus line operates independently. A simulation was carried out considering two medium frequency bus lines that serve a set of stops and where these two bus lines coexist in a given subset of stops. In the simulation we compared the existence of a central operator, using the optimization model we developed, against the independent operation of each line.In the simulations the central operator showed a greater reduction in the overall waiting time of the passengers of 55% compared to a no control scenario. It also provided a balanced load of the buses along the corridor, and a lower variability of the bus headways in the subset of stops where the lines coexist, thus obtaining better reliability for all types of passengers present in the public transport system.     

Methods for creating bus timetables

This paper provides alternative methods for constructing bus timetables using passenger load data. It attempts to fulfill six major objectives: to evaluate alternative timetables in terms of required resources; to improve the correspondence of bus departure times with passenger demand; to provide alternative timetables for the schedulers' use in specific scheduling situations; to permit direct bus frequency changes for possible exceptions (known to the schedulers) which do not rely on passenger demand data; to allow the construction of timetables with headway smoothing techniques (similar to that performed manually); and to integrate different headway setting and different timetable construction methods. The procedures developed set the bus departure times for the case of evenly spaced headways and for the case of allowing the headways to be unevenly spaced. In the first case, smoothing techniques are developed in the transition segments between adjacent time periods. In the second case, the departure times are shifted so as to obtain uniform average loads instead of even headways. The final product of the research consists of a set of computer programs which are tested on a heavy bus line in Los Angeles.     

A self-adaptive method to equalize headways: Numerical analysis and comparison

In uncontrolled bus systems, buses tend to bunch due to the stochastic nature of traffic flows and passenger demand at bus stops. Although schedules and priori target methods introduce slack time to delay buses at control points to maintain constant headways between successive buses, too much slack required delay passengers on-board. In addition, these methods focus on regular headways and do not consider the rates of convergence of headways after disturbances. We propose a self-adaptive control scheme to equalize the headways of buses with little slack in a single line automatically. The proposed method only requires the information from the current bus at the control point and both its leading and following buses. This elegant method is shown to regulate headways faster than existing methods. In addition, compared to previous self-equalizing methods, the proposed method can improve the travel time of buses by about 12%, while keeping the waiting time of passengers almost the same.     

Timetable optimization models and methods for minimizing passenger waiting time at public transit terminals

This paper focuses on developing mathematical optimization models for the train timetabling problem with respect to dynamic travel demand and capacity constraints. The train scheduling models presented in this paper aim to minimize passenger waiting times at public transit terminals. Linear and non-linear formulations of the problem are presented. The non-linear formulation is then improved through introducing service frequency variables. Heuristic rules are suggested and embedded in the improved non-linear formulation to reduce the computational time effort needed to find the upper bound. The effectiveness of the proposed train timetabling models is illustrated through the application to an underground urban rail line in the city of Tehran. The results demonstrate the effectiveness of the proposed demand-oriented train timetabling models, in terms of decreasing passenger waiting times. Compared to the baseline and regular timetables, total waiting time is reduced by 6.36% and 10.55% respectively, through the proposed mathematical optimization models.     

An activity-based approach for scheduling multimodal transit services

This paper proposes a new activity-based transit assignment model for investigating the scheduling (or timetabling) problem of transit services in multi-modal transit networks. The proposed model can be used to generate the short-term and long-term timetables of multimodal transit lines for transit operations and service planning purposes. The interaction between transit timetables and passenger activity-travel scheduling behaviors is captured by the proposed model, as the activity and travel choices of transit passengers are considered explicitly in terms of departure time choice, activity/trip chain choices, activity duration choice, transit line and mode choices. A heuristic solution algorithm which combines the Hooke–Jeeves method and an iterative supply–demand equilibrium approach is developed to solve the proposed model. Two numerical examples are presented to illustrate the differences between the activity-based approach and the traditional trip-based method, together with comparison on the effects of optimal timetables with even and uneven headways. It is shown that the passenger travel scheduling pattern derived from the activity-based approach is significantly different from that obtained by the trip-based method, and that a demand-sensitive (with uneven headway) timetable is more efficient than an even-headway timetable.     

Demand-driven timetable design for metro services

Timetable design is crucial to the metro service reliability. A straightforward and commonly adopted strategy in daily operation is a peak/off-peak-based schedule. However, such a strategy may fail to meet dynamic temporal passenger demand, resulting in long passenger waiting time at platforms and over-crowding in trains. Thanks to the emergence of smart card-based automated fare collection systems, we can now better quantify spatial–temporal demand on a microscopic level. In this paper, we formulate three optimization models to design demand-sensitive timetables by demonstrating train operation using equivalent time (interval). The first model aims at making the timetable more dynamic; the second model is an extension allowing for capacity constraints. The third model aims at designing a capacitated demand-sensitive peak/off-peak timetable. We assessed the performance of these three models and conducted sensitivity analyzes on different parameters on a metro line in Singapore, finding that dynamical timetable built with capacity constraints is most advantageous. Finally, we conclude our study and discuss the implications of the three models: the capacitated model provides a timetable which shows best performance under fixed capacity constraints, while the uncapacitated model may offer optimal temporal train configuration. Although we imposed capacity constraints when designing the optimal peak/off-peak timetable, its performance is not as good as models with dynamical headways. However, it shows advantages such as being easier to operate and more understandable to the passengers.     

Unified estimator for excess journey time under heterogeneous passenger incidence behavior using smartcard data

Excess journey time (EJT), the difference between actual passenger journey times and journey times implied by the published timetable, strikes a useful balance between the passenger’s and operator’s perspectives of public transport service quality. Using smartcard data, this paper tried to characterize transit service quality with EJT under heterogeneous incidence behavior (arrival at boarding stations). A rigorous framework was established for analyzing EJT, in particular for reasoning about passenger’ journey time standards as implied by varying incidence behavior. It was found that although the wrong assumption about passenger incidence behavior and journey time standards could result in a biased estimate of EJT for individual passenger journeys, the unified estimator of EJT proposed in this paper is unbiased at the aggregate level regardless of the passenger incidence behavior (random incidence, scheduled incidence, or a mixture of both). A case study based on the London Overground network (with a tap-in-and-tap-out smartcard system) was conducted to demonstrate the applicability of the proposed method. EJT was estimated using the smartcard (Oyster) data at various levels of spatial and temporal aggregation in order to measure and evaluate the service quality. Aggregate EJT was found to vary substantially across the different London Overground lines and across time periods of weekday service.     

Improved customs inspection at a small international airport: Case study: Colombo

The present procedures for processing arriving passengers at the Colombo International Airport cause inordinte waiting times. An alternate plan, which is based on state of the art customs procedures, and which can reduce waiting times significantly while maintaining a high level of enforcement, is proposed. The present and proposed procedures are analyzed and compared with respect to passenger waiting times, using deterministic queueing theory. An optimal inspection rate of passengers by the customs service is proposed taking into account the fraction of inspected passengers, the waiting time of passengers and the cost of customs processing.     

Predicting disruptions and their passenger delay impacts for public transport stops

Disruptions in public transport can have major implications for passengers and service providers. Our study objective is to develop a generic approach to predict how often different disruption types occur at different stations of a public transport network, and to predict the impact related to these disruptions as measured in terms of passenger delays. We propose a supervised learning approach to perform these predictions, as this allows for predictions for individual stations for each time period, without the requirement of having sufficient empirical disruption observations available for each location and time period. This approach also enables a fast prediction of disruption impacts for a large number of disruption instances, hence addressing the computational challenges that rise when typical public transport assignment or simulation models would be used for real-world public transport networks. To improve transferability of our study results, we cluster stations based on their contribution to network vulnerability using unsupervised learning. This supports public transport agencies to apply the appropriate type of measure aimed to reduce disruptions or to mitigate disruption impacts for each station type. Applied to the Washington metro network, we predict a yearly passenger delay of 5.9 million hours for the total metro network. Based on the clustering, five different types of station are distinguished. Stations with high train frequencies and high passenger volumes located at central trunk sections of the network show to be most critical, along with start/terminal and transfer stations. Intermediate stations located at branches of a line are least critical.

     

A bi-level model for single-line rail timetable design with consideration of demand and capacity

This paper proposes a bi-level model to solve the timetable design problem for an urban rail line. The upper level model aims at determining the headways between trains to minimize total passenger cost, which includes not only the usual perceived travel time cost, but also penalties during travel. With the headways given by the upper level model, passengers’ arrival times at their origin stops are determined by the lower level model, in which the cost-minimizing behavior of each passenger is taken into account. To make the model more realistic, explicit capacity constraints of individual trains are considered. With these constraints, passengers cannot board a full train, but wait in queues for the next coming train. A two-stage genetic algorithm incorporating the method of successive averages is introduced to solve the bi-level model. Two hypothetical examples and a real world case are employed to evaluate the effectiveness of the proposed bi-level model and algorithm. Results show that the bi-level model performs well in reducing total passenger cost, especially in reducing waiting time cost and penalties. And the section loading-rates of trains in the optimized timetable are more balanced than the even-headway timetable. The sensitivity analyses show that passenger’s desired arrival time interval at destination and crowding penalty factor have a high influence on the optimal solution. And with the dispersing of passengers' desired arrival time intervals or the increase of crowding penalty factor, the section loading-rates of trains become more balanced.     

Train scheduling for minimizing passenger waiting time with time-dependent demand and skip-stop patterns: Nonlinear integer programming models with linear constraints

This paper focuses on how to minimize the total passenger waiting time at stations by computing and adjusting train timetables for a rail corridor with given time-varying origin-to-destination passenger demand matrices. Given predetermined train skip-stop patterns, a unified quadratic integer programming model with linear constraints is developed to jointly synchronize effective passenger loading time windows and train arrival and departure times at each station. A set of quadratic and quasi-quadratic objective functions are proposed to precisely formulate the total waiting time under both minute-dependent demand and hour-dependent demand volumes from different origin–destination pairs. We construct mathematically rigorous and algorithmically tractable nonlinear mixed integer programming models for both real-time scheduling and medium-term planning applications. The proposed models are implemented using general purpose high-level optimization solvers, and the model effectiveness is further examined through numerical experiments of real-world rail train timetabling test cases.     

Real time transit demand prediction capturing station interactions and impact of special events

Demand for public transportation is highly affected by passengers’ experience and the level of service provided. Thus, it is vital for transit agencies to deploy adaptive strategies to respond to changes in demand or supply in a timely manner, and prevent unwanted deterioration in service quality. In this paper, a real time prediction methodology, based on univariate and multivariate state-space models, is developed to predict the short-term passenger arrivals at transit stations. A univariate state-space model is developed at the station level. Through a hierarchical clustering algorithm with correlation distance, stations with similar demand patterns are identified. A dynamic factor model is proposed for each cluster, capturing station interdependencies through a set of common factors. Both approaches can model the effect of exogenous events (such as football games). Ensemble predictions are then obtained by combining the outputs from the two models, based on their respective accuracy. We evaluate these models using data from the 32 stations on the Central line of the London Underground (LU), operated by Transport for London (TfL). The results indicate that the proposed methodology performs well in predicting short-term station arrivals for the set of test days. For most stations, ensemble prediction has the lowest mean error, as well as the smallest range of error, and exhibits more robust performance across the test days.     

Multi-objective re-synchronizing of bus timetable: Model,complexity and solution

This work is originally motived by the re-planning of a bus network timetable. The existing timetable with even headways for the network is generated using line by line timetabling approach without considering the interactions between lines. Decision-makers (i.e., schedulers) intend to synchronize vehicle timetable of lines at transfer nodes to facilitate passenger transfers while being concerned with the impacts of re-designed timetable on the regularity of existing timetable and the accustomed trip plans of passengers. Regarding this situation, we investigate a multi-objective re-synchronizing of bus timetable (MSBT) problem, which is characterized by headway-sensitive passenger demand, uneven headways, service regularity, flexible synchronization and involvement of existing bus timetable. A multi-objective optimization model for the MSBT is proposed to make a trade-off between the total number of passengers benefited by smooth transfers and the maximal deviation from the departure times of the existing timetable. By clarifying the mathematical properties and solution space of the model, we prove that the MSBT problem is NP-hard, and its Pareto-optimal front is non-convex. Therefore, we design a non-dominated sorting genetic (NSGA-II) based algorithm to solve this problem. Numerical experiments show that the designed algorithm, compared with enumeration method, can generate high-quality Pareto solutions within reasonable times. We also find that the timetable allowing larger flexibility of headways can obtain more and better Pareto-optimal solutions, which can provide decision-makers more choice.     

Optimization of headways with stop‐skipping control: a case study of bus rapid transit system

Bus rapid transit system is designed to provide high‐quality and cost‐efficient passenger transportation services. In order to achieve this design objective, effective scheduling strategies are required. This research aims at improving the operation efficiency and service quality of a BRT system through integrated optimization of its service headways and stop‐skipping strategy. Based on cost analysis for both passengers and operation agencies, an optimization model is established. A genetic algorithms based algorithm and an application‐oriented solution method are developed. Beijing BRT Line 2 has been chosen as a case study, and the effectiveness of the optimal headways with stop‐skipping services under different demand levels has been analyzed. The results has shown that, at a certain demand level, the proposed operating strategy can be most advantageous for passengers with an accepted increase of operating costs, under which the optimum headway is between 3.5 and 5.5 min for stop‐skipping services during the morning peak hour depending on the demand with the provision of stop‐skipping services. The effectiveness of the optimal headways with stop‐skipping services is compared with those of existing headways and optimal headways without stop‐skipping services. The results show that operating strategies under the optimal headways with stop‐skipping services outperforms the other two operating strategies with respect to total costs and in‐vehicle time for passengers. Copyright © 2014 John Wiley & Sons, Ltd.     

Evaluating the added-value of online bus arrival prediction schemes

Online predictions of bus arrival times have the potential to reduce the uncertainty associated with bus operations. By better anticipating future conditions, online predictions can reduce perceived and actual passenger travel times as well as facilitate more proactive decision making by service providers. Even though considerable research efforts were devoted to the development of computationally expensive bus arrival prediction schemes, real-world real-time information (RTI) systems are typically based on very simple prediction rules. This paper narrows down the gap between the state-of-the-art and the state-of-the-practice in generating RTI for public transport systems by evaluating the added-value of schemes that integrate instantaneous data and dwell time predictions. The evaluation considers static information and a commonly deployed scheme as a benchmark. The RTI generation algorithms were applied and analyzed for a trunk bus network in Stockholm, Sweden. The schemes are assessed and compared based on their accuracy, reliability, robustness and potential waiting time savings. The impact of RTI on passengers waiting times are compared with those attained by service frequency and regularity improvements. A method which incorporates information on downstream travel conditions outperforms the commonly deployed scheme, leading to a 25% reduction in the mean absolute error. Furthermore, the incorporation of instantaneous travel times improves the prediction accuracy and reliability, and contributes to more robust predictions. The potential waiting time gains associated with the prediction scheme are equivalent to the gains expected when introducing a 60% increase in service frequency, and are not attainable by service regularity improvements.     

Estimation method for railway passengers’ train choice behavior with smart card transaction data

Smart card systems have become the predominant method of collecting public transport fares in Japan. Transaction data obtained through smart cards have resulted in a large amount of archived information on how passengers use public transportation. The data have the potential to be used for modeling passenger behavior and demand for public transportation. This study focused on train choices made by railway passengers. If each passenger’s train choice can be identified over a long period of time, this information would be useful for improving the customer relationship management of the railway company and for improving train timetables. The aim of this study was to develop a methodology for estimating which train is boarded by each smart card holder. This paper presents a methodology and an algorithm for estimation using long-term transaction data. To validate the computation time and accuracy of the estimation, an empirical analysis is carried out using actual transaction data provided by a railway company in Japan. The results show that the proposed method is capable of estimating passenger usage patterns from smart card transaction data collected over a long time period.