A dynamic linear model for the estimation of time‐varying origin–destination matrices from link counts

We propose a dynamic linear model (DLM) for the estimation of day‐to‐day time‐varying origin–destination (OD) matrices from link counts. Mean OD flows are assumed to vary over time as a locally constant model. We take into account variability in OD flows, route flows, and link volumes. Given a time series of observed link volumes, sequential Bayesian inference is applied in order to estimate mean OD flows. The conditions under which mean OD flows may be estimated are established, and computational studies on two benchmark transportation networks from the literature are carried out. In both cases, the DLM converged to the unobserved mean OD flows when given sufficient observations of traffic link volumes despite assuming uninformative prior OD matrices. We discuss limitations and extensions of the proposed DLM. Copyright © 2017 John Wiley & Sons, Ltd.     

Analytical model for calibrating delay at congested bus stops

Abstract

A model is proposed to calculate the overall operating and delay times spent at bus stops due to passenger boarding and alighting and the time lost to queuing caused by bus stop saturation. A formula for line demand at each stop and the interaction between the buses themselves is proposed and applied to different bus stops depending on the number of available berths. The application of this model has quantified significant operational delays suffered by users and operator due to consecutive bus arrival at stops, even with flows below bus stop capacity.     

Ridership estimation procedure for a transit corridor with new bus rapid transit service

Ridership estimation is a critical step in the planning of a new transit route or change in service. Very often, when a new transit route is introduced, the existing routes will be modified, vehicle capacities changed, or service headways adjusted. This has made ridership forecasts for the new, existing, and modified routes challenging. This paper proposes and demonstrates a procedure that forecasts the ridership of all transit routes along a corridor when a new bus rapid transit (BRT) service is introduced and existing regular bus services are adjusted. The procedure uses demographic data along the corridor, a recent origin–destination survey data, and new and existing transit service features as inputs. It consists of two stages of transit assignment. In the first stage, a transit assignment is performed with the existing transit demand on the proposed BRT and existing bus routes, so that adjustments to the existing bus services can be identified. This transit assignment is performed iteratively until there is no adjustment in transit services. In the second stage, the transit assignment is carried out with the new BRT and adjusted regular bus services, but incorporates a potential growth in ridership because of the new BRT service. The final outputs of the procedure are ridership for all routes and route segments, boarding and alighting volumes at all stops, and a stop‐by‐stop trip matrix. The proposed ridership estimation procedure is applicable to a new BRT route with and without competing regular bus routes and with BRT vehicles traveling in dedicated lanes or in mixed traffic. The application of the proposed procedure is demonstrated via a case study along the Alameda Corridor in El Paso, Texas. Copyright © 2015 John Wiley & Sons, Ltd.     

Estimation of population origin–interchange–destination flows on multimodal transit networks

Previous research has combined automated fare-collection (AFC) and automated vehicle-location (AVL) data to infer the times and locations of passenger origins, interchanges (transfers), and destinations on multimodal transit networks. The resultant origin–interchange–destination flows (and the origin–destination (OD) matrices that comprise those flows), however, represent only a sample of total ridership, as they contain only those journeys made using the AFC payment method that have been successfully recorded or inferred. This paper presents a method for scaling passenger-journey flows (i.e., linked-trip flows) using additional information from passenger counts at each station gate and bus farebox, thereby estimating the flows of non-AFC passengers and of AFC passengers whose journeys were not successfully inferred.The proposed method is applied to a hypothetical test network and to AFC and AVL data from London’s multimodal public transit network. Because London requires AFC transactions upon both entry and exit for rail trips, a rail-only OD matrix is extracted from the estimated multimodal linked-trip flows, and is compared to a rail OD matrix generated using the iterative proportional fitting method.     

A theoretical foundation for the relationship between generalized origin–destination matrix and flow matrix based on ordinal graph trajectories

This paper shows the relationship between flow, generalized origin–destination (OD), and alternative route flow from a set of ordinal graph trajectories. In contrast to traffic assignment methods that employ OD matrix to produce flow matrix, we use ordinal trajectory on a network graph as input and produce both the generalized OD matrix and the flow matrix, with the alternative and substitute route flow matrices as additional outputs. By using linear algebra‐like operations on matrix sets, the relationship between network utilization (in terms of flow, generalized OD, alternative route flow, and desire line) and network structure (in terms of distance matrix and adjacency matrix) are derived. Copyright © 2012 John Wiley & Sons, Ltd.     

Evaluating the effects of bus design on passenger flow: Is agent-based simulation a feasible approach?

In this paper, we propose an agent-based simulation approach that is capable of simulating the flow of passengers on board buses and at bus stops. The intention is that it will be applied during vehicle development to analyze how vehicle design affects passenger flow, and thus also how it affects system performance such as dwell time. In turn, this could aid the developers in making design decisions early in the development process. Besides introducing the simulation tool itself, the paper explores the realism of the data generated by the tool. A number of passenger flow experiments featuring a full-scale bus mockup and 50 participants were carried out. The setup of these experiments mirrored a number of ‘bus journeys’ (regarding vehicle design, number of passengers boarding/alighting at each stop and so on) that had previously been simulated using the simulation tool. When the data from the simulations were compared with the data from the passenger flow experiments, it could be concluded that the tool is indeed able to generate realistic passenger flows, although with some errors when a large number of passengers board/alight. The simulated dwell times were rationally affected by the tested bus layout aspects. It was concluded that the tool makes it possible to evaluate how variations in bus layouts affect passenger flow, providing data of sufficiently high quality to be useful in early phases of vehicle design.     

Passenger travel characteristics and bus operational states: a study based on IC card and GPS data in Yinchuan,China

ABSTRACT

In recent years, public transport has been developing rapidly and producing large amounts of traffic data. Emerging big data-mining techniques enable the application of these data in a variety of ways. This study uses bus intelligent card (IC card) data and global positioning system (GPS) data to estimate passenger boarding and alighting stations. First, an estimation model for boarding stations is introduced to determine passenger boarding stations. Then, the authors propose an innovative uplink and downlink information identification model (UDI) to generate information for estimating alighting stations. Subsequently, the estimation model for the alighting stations is introduced. In addition, a transfer station identification model is also developed to determine transfer stations. These models are applied to Yinchuan, China to analyze passenger flow characteristics and bus operations. The authors obtain passenger flows based on stations (stops), bus lines, and traffic analysis zones (TAZ) during weekdays and weekends. Moreover, average bus operational speeds are obtained. These findings can be used in bus network planning and optimization as well as bus operation scheduling.     

Models of bus boarding and alighting dynamics

Understanding the dynamics of boarding/alighting activities and its impact on bus dwell times is crucial to improving bus service levels. However, research is limited as conventional data collection methods are both time and labour intensive. In this paper, we present the first use of smart card data to study passenger boarding/alighting behaviour and its impact on bus dwell time. Given the nature of these data, we focus on passenger activity time and do not account for the time necessary to open and close doors. We study single decker, double decker and articulated buses and identify the specific effects of floor/entrance type, number of activities and occupancy on both boarding and alighting dynamics. A linear relationship between average boarding and alighting times and their respective standard deviations is also found, whereas the variability of boarding and alighting time decreases with the number of passengers boarding and alighting. After observing the cumulative boarding/alighting processes under different occupancy conditions, we propose a new model to estimate passenger activity time, by introducing critical occupancy – a parameter incorporating the friction between boarding/alighting and on-board passengers. We conduct regression analyses with the proposed and another popular model for simultaneous boarding/alighting processes, finding that the critical occupancy plays a significant role in determining the regime of boarding and alighting processes and the overall activity time. Our results provide potential implications for practice and policy, such as identifying optimal vehicle type for a particular route and modelling transit service reliability.     

Estimation of origin-destination matrices from link counts and sporadic routing data

Estimation of origin-destination (OD) matrices from link count data is a challenging problem because of the highly indeterminate relationship between the observations and the latent route flows. Conversely, estimation is straightforward if we observe the path taken by each vehicle. We consider an intermediate problem of increasing practical importance, in which link count data is supplemented by routing information for a fraction of vehicles on the network. We develop a statistical model for these combined data sources and derive some tractable normal approximations thereof. We examine likelihood-based inference for these normal models under the assumption that the probability of vehicle tracking is known. We show that the likelihood theory can be non-standard because of boundary effects, and provide conditions under which such irregular behaviour will be observed in practice. For regular cases we outline connections with existing generalised least squares methods. We then consider estimation of OD matrices under estimated and/or misspecified models for the probability of vehicle tracking. Theoretical developments are complemented by simulation experiments and an illustrative example using a section of road network from the English city of Leicester.     

Berth assignment planning for multi‐line bus stops

In this paper, we study an important problem that arises with the fast development of public transportation systems: when a large number of bus lines share the same bus stop, a long queue of buses often forms when they wait to get into the stop in rush hours. This causes a significant increase of bus delay and a notable drop of traffic capacity near the bus stop. Various measures had been proposed to relieve the congestions near bus stops. However, all of them require considerable financial budgets and construction time costs. In this paper, with the concept of berth assignment redesign, a simulation‐based heuristic algorithm is proposed to make full use of exiting bus berths. In this study, a trustable simulation platform is designed, and the major influencing factors for bus stop operations are considered. The concept of risk control is also introduced to better evaluate the performance of different berth arrangement plans and makes an appropriate trade‐off between the system's efficiency and stability. Finally, a heuristic algorithm is proposed to find a sub‐optimal berth assignment plan. Tests on a typical bus stop show that this algorithm is efficient and fast. The sub‐optimal berth assignment plan obtained by this algorithm could make remarkable improvements to an actual bus stop. Copyright © 2013 John Wiley & Sons, Ltd.     

Methods for pre-processing smartcard data to improve data quality

In recent years smartcards have been implemented in many transit systems around the world as a means by which passengers pay for travel. In addition to allowing speedier boardings there are many secondary benefits of smartcard systems including better understanding of travel patterns and behaviour of travellers. Such research is dependent on the smartcard correctly recording the boarding stop, and where available the alighting stop. It is also dependent on the smartcard system correctly aggregating individual rides into trips.This paper identifies causes for why smartcard systems may not correctly record such information. The first contribution of the paper is to propose a set of rules to aggregate individual rides into a single trip. This is critical in the research of activity based modelling as well as for correctly charging the passenger. The second contribution of the paper is to provide an approach to identify erroneous tap-out data, either caused by system problems or by the user. An approach to detecting this phenomenon is provided. The output from this analysis is then used to identify faulty vehicles or data supply using the “comparison against peers approach”. This third contribution of the paper identifies where transit agencies and operators should target resources to improve performance of their Automatic Vehicle Location systems. This method could also be used to identify users who appear to be tapping out too early.The approaches are tested using smartcard data from the Singapore public transport network from one week in April 2011. The results suggest that approximately 7.7% of all smartcard rides recorded the passenger as alighting one stop before the bus stop that they most probably alighted at. A further 0.7% of smartcard rides recorded the passenger as alighting more than one stop before the bus stop that they most probably alighted at. There was no evidence that smartcards overestimated the distance travelled by the passenger.     

GIS-based transit trip allocation methods converting stop-level boarding and alighting trips into TAZ trips

ABSTRACT

This study introduces a framework to improve the utilization of new data sources such as automated vehicle location (AVL) and automated passenger counting (APC) systems in transit ridership forecasting models. The direct application of AVL/APC data to travel forecasting requires an important intermediary step that links stops and activities – boarding and alighting – to the actual locations (at the traffic analysis zone (TAZ) level) that generated/attracted these trips. GIS-based transit trip allocation methods are developed with a focus on considering the case when the access shed spans multiple TAZs. The proposed methods improve practical applicability with easily obtained data. The performance of the proposed allocation methods is further evaluated using transit on-board survey data. The results show that the methods can effectively handle various conditions, particularly for major activity generators. The average errors between observed data and the proposed method are about 8% for alighting trips and 18% for boarding trips.     

Optimal design of a short‐turning strategy considering seat availability

We develop a methodology to optimize the schedule coordination of a full‐stop service pattern and a short‐turning service pattern on a bus route. To capture the influence of bus crowding and seat availability on passengers' riding experience, we develop a Markov model to describe the seat‐searching process of a passenger and an approach to estimate the transition probabilities of the Markov model. An optimization model that incorporates the Markov model is proposed to design the short‐turning strategy. The proposed model minimizes the total cost, which includes operational cost, passengers' waiting time cost and passengers' in‐vehicle travel time cost. Algorithm is developed to produce optimal values of the decision variables. The proposed methodology is evaluated in a case study. Compared with methodologies that ignore the effect of bus crowding, the proposed methodology could better balance bus load along the route and between two service patterns, provide passengers with better riding experience and reduce the total cost. In addition, it is shown that the optimal design of the short‐turning strategy is sensitive to seat capacity. Copyright © 2016 John Wiley & Sons, Ltd.     

Estimation of train dwell time at short stops based on track occupation event data: A study at a Dutch railway station

Train dwell time is one of the most unpredictable components of railway operations, mainly because of the varying volumes of alighting and boarding passengers. However, for reliable estimations of train running times and route conflicts on main lines, it is necessary to obtain accurate estimations of dwell times at the intermediate stops on the main line, the so‐called short stops. This is a great challenge for a more reliable, efficient and robust train operation. Previous research has shown that the dwell time is highly dependent on the number of boarding and alighting passengers. However, these numbers are usually not available in real time. This paper discusses the possibility of a dwell time estimation model at short stops without passenger demand information by means of a statistical analysis of track occupation data from the Netherlands. The analysis showed that the dwell times are best estimated for peak and off‐peak hours separately. The peak‐hour dwell times are estimated using a linear regression model of train length, dwell times at previous stops and dwell times of the preceding trains. The off‐peak‐hour dwell times are estimated using a non‐parametric regression model, in particular, the k‐nearest neighbor model. There are two major advantages of the proposed estimation models. First, the models do not need passenger flow data, which is usually impossible to obtain in real time in practice. Second, detailed parameters of rolling stock configuration and platform layout are not required, which makes the model more generic and eases implementation. A case study at Dutch railway stations shows that the estimation accuracy is 85.8%–88.5% during peak hours and 80.1% during off‐peak hours, which is relatively high. We conclude that the estimation of dwell times at short stop stations without passenger data is possible. Copyright © 2016 John Wiley & Sons, Ltd.     

Optimization of bus stop locations for improving transit accessibility

A mathematical model is developed in this paper to improve the accessibility of a bus service. To formulate the optimization model, a segment of a bus route is given, on which a number of demand entry points are distributed realistically. The objective total cost function (i.e. the sum of supplier and user costs) is minimized by optimizing the number and locations of stops, subject to non‐additive users' value of time. A numerical example is designed to demonstrate the effectiveness of the method thus developed to optimize the bus stop location problem. The sensitivity of the total cost to various parameters (e.g. value of users' time, access speed, and demand density) and the effect of the parameters on the optimal stop locations are analyzed and discussed.     

Estimation of bus dwell time using univariate time series models

A significant proportion of bus travel time is contributed by dwell time for passenger boarding and alighting. More accurate estimation of bus dwell time (BDT) can enhance efficiency and reliability of public transportation system. Regression and probabilistic models are commonly used in literatures where a set of independent variables are used to define the statistical relationship between BDT and its contributing factors. However, due to technical and monetary constraints, it is not always feasible to collect all the data required for the models to work. More importantly, the contributing factors may vary from one bus route to another. Time series based methods can be of great interest as they require only historical time series data, which can be collected using a facility known as automatic vehicle location (AVL) system. This paper assesses four different time series based methods namely random walk, exponential smoothing, moving average (MA), and autoregressive integrated moving average to model and estimate BDT based on AVL data collected from Auckland. The performances of the proposed methods are ranked based on three important factors namely prediction accuracy, simplicity, and robustness. The models showed promising results and performed differently for central business district (CBD) and non‐CBD bus stops. For CBD bus stops, MA model performed the best, whereas for non‐CBD bus stops, ARIMA model performed the best compared with other time series based models. Copyright © 2014 John Wiley & Sons, Ltd.     

Estimation of a route choice model for urban public transport using smart card data

This paper describes a logit model of route choice for urban public transport and explains how the archived data from a smart card-based fare payment system can be used for the choice set generation and model estimation. It demonstrates the feasibility and simplicity of applying a trip-chaining method to infer passenger journeys from smart card transactions data. Not only origins and destinations of passenger journeys can be inferred but also the interchanges between the segments of a linked journey can be recognised. The attributes of the corresponding routes, such as in-vehicle travel time, transfer walking time and to get from alighting stop to trip destination, the need to change, and the time headway of the first transportation line, can be determined by the combination of smart card data with other data sources, such as a street map and timetable. The smart card data represent a large volume of revealed preference data that allows travellers' behaviour to be modelled with higher accuracy than by using traditional survey data. A multinomial route choice model is proposed and estimated by the maximum likelihood method, using urban public transport in ?ilina, the Slovak Republic, as a case study     

A model of stoppings on urban bus routes

The amount of time required to pick up and discharge passengers is an important issue in the planning and modeling of urban bus systems. Several past studies have employed models of this component of bus travel time which are based, in part, on a model of the number of stoppings the bus makes to pick up or discharge passengers. Most past versions of this model have assumed that expected demand does not vary from stop to stop or from trip to trip, but that the number of passengers demanding service at any given stop during any given trip follows a Poisson distribution. An alternative model is derived, based on the assumption that expected demand varies among stops and times of day but is fixed from day to day at any given stop and time of day. Boarding and alighting survey data are used to verify that the “average-demand” Poisson model consistently overestimates the number of stoppings and to calibrate an approximate version of the alternative model. A stop-spacing optimization model previously developed by Kikuchi and Vuchic is reevaluated using the alternative stopping model in place of the average demand model used in the original version. The results are found to be considerably different, thus indicating that transit route optimization models are sensitive to the way in which stopping processes are modeled.     

Investigating the impact of stochastic vehicle arrivals to optimal stop spacing and headway for a feeder bus route

Stop spacing and service frequency (i.e., the inverse of headway) are key elements in transit service planning. The trade‐offs between increasing accessibility and reducing travel time, which affect transit system performance, need to be carefully evaluated. The objective of this study is to optimize stop spacing and headway for a feeder bus route, considering the relationship between the variance of inter‐arrival time (VIAT), which yields the minimum total cost (including user and operator costs). A solution algorithm, called successive substitution, is adapted to efficiently search for the optimal solutions. In a numerical example, the developed model is applied to planning a feeder bus route in Newark, New Jersey. The results indicate that the optimal stop spacing should be longer that those suggested by previous studies where the impact of VIAT was ignored. Reducing VIAT via certain operational control strategies (i.e., holding/stop‐skipping, transit signal priority) may shorten stop spacing and improve accessibility. Copyright © 2014 John Wiley & Sons, Ltd.