Modelling public transport on‐board congestion: comparing schedule‐based and agent‐based assignment approaches and their implications

Transit systems are subject to congestion that influences system performance and level of service. The evaluation of measures to relieve congestion requires models that can capture their network effects and passengers' adaptation. In particular, on‐board congestion leads to an increase of crowding discomfort and denied boarding and a decrease in service reliability. This study performs a systematic comparison of alternative approaches to modelling on‐board congestion in transit networks. In particular, the congestion‐related functionalities of a schedule‐based model and an agent‐based transit assignment model are investigated, by comparing VISUM and BusMezzo, respectively. The theoretical background, modelling principles and implementation details of the alternative models are examined and demonstrated by testing various operational scenarios for an example network. The results suggest that differences in modelling passenger arrival process, choice‐set generation and route choice model yield systematically different passenger loads. The schedule‐based model is insensitive to a uniform increase in demand or decrease in capacity when caused by either vehicle capacity or service frequency reduction. In contrast, nominal travel times increase in the agent‐based model as demand increases or capacity decreases. The marginal increase in travel time increases as the network becomes more saturated. Whilst none of the existing models capture the full range of congestion effects and related behavioural responses, existing models can support different planning decisions. Copyright © 2016 John Wiley & Sons, Ltd.     

A schedule‐based dynamic transit network model — Recent advances and prospective future research

Using the schedule‐based approach, in which scheduled timetables are used to describe the movement of vehicles, a dynamic transit assignment model is formulated. Passengers are assumed to travel on a path with minimum generalized cost that consists of four components: in‐vehicle time; waiting time; walking time; and a time penalty for each line change. A specially developed branch and bound algorithm is used to generate the time‐dependent minimum path. The assignment procedure is conducted over a period in which both passenger demand and train headway are varying. This paper presents an overview of the research that has been carried out by the authors to develop the schedule‐based transit assignment model, and offers perspectives for future research.     

A network‐based dynamic air traffic flow model for short‐term en route traffic prediction

This paper presents a dynamic network‐based approach for short‐term air traffic flow prediction in en route airspace. A dynamic network characterizing both the topological structure of airspace and the dynamics of air traffic flow is developed, based on which the continuity equation in fluid mechanics is adopted to describe the continuous behaviour of the en route traffic. Building on the network‐based continuity equation, the space division concept in cell transmission model is introduced to discretize the proposed model both in space and time. The model parameters are sequentially updated based on the statistical properties of the recent radar data and the new predicting results. The proposed method is applied to a real data set from Shanghai Area Control Center for the short‐term air traffic flow prediction both at flight path and en route sector level. The analysis of the case study shows that the developed method can characterize well the dynamics of the en route traffic flow, thereby providing satisfactory prediction results with appropriate uncertainty limits. The mean relative prediction errors are less than 0.10 and 0.14, and the absolute errors fall in the range of 0 to 1 and 0 to 3 in more than 95% time intervals respectively, for the flight path and en route sector level. Copyright © 2017 John Wiley & Sons, Ltd.     

A schedule-based time-dependent trip assignment model for transit networks

A schedule-based time-dependent trip assignment model for transit networks is presented. First the transit network model is formulated using the schedule-based approach, in which the vehicles are assumed to arrive punctually in accordance with a scheduled time-table. Based on a previously developed time-dependent shortest path algorithm, an all-or-nothing network loading procedure is employed to assign the passenger trips onto the network. Both the passenger demand and scheduled time-table are time-varying. This provides a versatile tool for the evaluation of the performance of transit networks subject to peak period loading. A case study using the Mass Transit Railway System in Hong Kong is given to illustrate the potential applications of the model.     

A bi‐level programming approach — Optimal transit fare under line capacity constraints

The fare of a transit line is one of the important decision variables for transit network design. It has been advocated as an efficient means of coordinating the transit passenger flows and of alleviating congestion in the transit network. This paper shows how transit fare can be optimized so as to balance the passenger flow on the transit network and to reduce the overload delays of passengers at transit stops. A bi‐level programming method is developed to optimize the transit fare under line capacity constraints. The upper‐level problem seeks to minimize the total network travel time, while the lower‐level problem is a stochastic user equilibrium transit assignment model with line capacity constraints. A heuristic solution algorithm based on sensitivity analysis is proposed. Numerical example is used to illustrate the application of the proposed model and solution algorithm.     

A stochastic transit assignment model using a dynamic schedule-based network

Using the schedule-based approach, in which scheduled time-tables are used to describe the movement of vehicles, a dynamic transit assignment model is formulated. Passengers are assumed to travel on a path with minimum generalized cost which consists of four components: in-vehicle time; waiting time; walking time; and a time penalty for each line change. With the exception of in-vehicle time, each of the other cost components is weighted by a sensitivity coefficient which varies among travelers and is defined by a density function. This time-dependent and stochastic minimum path is generated by a specially developed branch and bound algorithm. The assignment procedure is conducted over a period in which both passenger demand and train headways are varying. Due to the stochastic nature of the assignment problem, a Monte Carlo approach is employed to solve the problem. A case study using the Mass Transit Railway System in Hong Kong is given to demonstrate the model and its potential applications.     

The effect of crowding on public transit user travel behavior in a large-scale public transportation system through modeling daily variations

In this paper, the crowding effect in a transit vehicle is modeled in a time-expanded network that considers the daily variation in passenger flows. The study models the daily variation of in-vehicle crowding in a real large-scale transit system. A transit assignment for this real network is modeled and implemented by constructing a crowding cost function that follows the valuation of crowding and by using the reliable shortest path finding method. The direct application of the crowding model to a real network for the Utah Transit Authority indicates that crowd modeling with multi-user classes could influence public transportation system planning and affect the revenues of transit agencies. Moreover, the addition of the disutility factor, crowding, does not always appear to cause an increase in disutility for transit users.     

Network equilibrium for congested multi‐mode networks with elastic demand

This paper proposes an elastic demand network equilibrium model for networks with transit and walking modes. In Hong Kong, the multi‐mode transit system services over 90% of the total journeys and the demand on it is continuously increasing. Transit and walking modes are related to each other as transit passengers have to walk to and from transit stops. In this paper, the multi‐mode elastic‐demand network equilibrium problem is formulated as a variational inequality problem where the combined mode and route choices are modeled in a hierarchical logit structures and the total travel demand for each origin‐destination pair is explicitly given by an elastic demand function. In addition, the capacity constraint for transit vehicles and the effects of bi‐directional flows on walkways are considered in the proposed model. All these congestion effects are taken into account for modeling the travel choices. A solution algorithm is developed to solve the multi‐mode elastic‐demand network equilibrium model. It is based on a Block Gauss‐Seidel decomposition approach coupled with the method of successive averages. A numerical example is used to illustrate the application of the proposed model and solution algorithm.     

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.     

Finding time‐robust fuel‐efficient paths for a call‐taxi in a stochastic city road network

Intra‐city commuting is being revolutionized by call‐taxi services in many developing countries such as India. A customer requests a taxi via phone, and it arrives at the right time and at the right location for the pick‐up. This mode of intra‐city travel has become one of the most reliable and convenient modes of transportation for customers traveling for business and non‐business purposes. The increased number of vehicles on city roads and raising fuel costs has prompted a new type of transportation logistics problem of finding a fuel‐efficient and quickest path for a call‐taxi through a city road network, where the travel times are stochastic. The stochastic travel time of the road network is induced by obstacles such as the traffic signals and intersections. The delay and additional fuel consumption at each of these obstacles are calculated that are later imputed to the total travel time and fuel consumption of a path. A Monte‐Carlo simulation‐based approach is proposed to identify unique fuel‐efficient paths between two locations in a city road network where each obstacle has a delay distribution. A multi‐criteria score is then assigned to each unique path based on the probability that the path is fuel efficient, the average travel time of the path and the coefficient of variation of the travel times of the path. Copyright © 2016 John Wiley & Sons, Ltd.     

International experience with speed limits during and prior to the energy crisis of 1973–4

This paper presents an artificial neural network (ANN) based method for estimating route travel times between individual locations in an urban traffic network. Fast and accurate estimation of route travel times is required by the vehicle routing and scheduling process involved in many fleet vehicle operation systems such as dial‐a‐ride paratransit, school bus, and private delivery services. The methodology developed in this paper assumes that route travel times are time‐dependent and stochastic and their means and standard deviations need to be estimated. Three feed‐forward neural networks are developed to model the travel time behaviour during different time periods of the day‐the AM peak, the PM peak, and the off‐peak. These models are subsequently trained and tested using data simulated on the road network for the City of Edmonton, Alberta. A comparison of the ANN model with a traditional distance‐based model and a shortest path algorithm is then presented. The practical implication of the ANN method is subsequently demonstrated within a dial‐a‐ride paratransit vehicle routing and scheduling problem. The computational results show that the ANN‐based route travel time estimation model is appropriate, with respect to accuracy and speed, for use in real applications.     

A connected-vehicle-based dynamic control model for managing the bus bunching problem with capacity constraints

This paper describes a connected-vehicle-based system architecture which can provide more precise and comprehensive information on bus movements and passenger status. Then a dynamic control method is proposed using connected vehicle data. Traditionally, the bus bunching problem has been formulated into one of two types of optimization problem. The first uses total passenger time cost as the objective function and capacity, safe headway, and other factors as constraints. Due to the large number of scenarios considered, this type of framework is inefficient for real-time implementation. The other type uses headway adherence as the objective and applies a feedback control framework to minimize headway variations. Due to the simplicity in the formulation and solution algorithms, the headway-based models are more suitable for real-time transit operations. However, the headway-based feedback control framework proposed in the literature still assumes homogeneous conditions at all bus stations, and does not consider restricting passenger loads within the capacity constraints. In this paper, a dynamic control framework is proposed to improve not only headway adherence but also maintain the stability of passenger load within bus capacity in both homogenous and heterogeneous situations at bus stations. The study provides the stability conditions for optimal control with heterogeneous bus conditions and derives optimal control strategies to minimize passenger transit cost while maintaining vehicle loading within capacity constraints. The proposed model is validated with a numerical analysis and case study based on field data collected in Chengdu, China. The results show that the proposed model performs well on high-demand bus routes.     

A dynamic shortest path algorithm using multi‐step ahead link travel time prediction

In this paper, a multi‐step ahead prediction algorithm of link travel speeds has been developed using a Kalman filtering technique in order to calculate a dynamic shortest path. The one‐step and the multi‐step ahead link travel time prediction models for the calculation of the dynamic shortest path have been applied to the directed test network that is composed of 16 nodes: 3 entrance nodes, 2 exit nodes and 11 internal nodes. Time‐varying traffic conditions such as flows and travel time data for the test network have been generated using the CORSIM model. The results show that the multi‐step ahead algorithm is compared more favorably for searching the dynamic shortest time path than the other algorithm.     

Including heavy vehicles in a car‐following model: modelling,calibrating and validating

Heavy vehicles influence general traffic in many different ways compared with passenger vehicles, and this may result in different levels of traffic instability. Increases in the number and proportion of heavy vehicles in the traffic stream will therefore result in different traffic flow conditions. This research initially outlines the different car‐following behaviour of drivers in congested heterogeneous traffic conditions indicating the necessity for developing a car‐following model, which includes these differences. A psychophysical car‐following model, similar in form to Weideman's car‐following model, was developed. Due to the complexity of the developed model, the calibration of the model was undertaken using a particle swarm optimisation algorithm with the data recorded under congested traffic conditions. This was then incorporated into a traffic microsimulation model. The results showed that the car‐following perceptual thresholds and thus action points of drivers differ based on their vehicle and the lead vehicle types. The inclusion of the heavy vehicles in the model showed significant impacts on the traffic dynamic and interactions amongst different vehicles. Copyright © 2016 John Wiley & Sons, Ltd.     

Train rescheduling model with train delay and passenger impatience time in urban subway network

This paper considers the train rescheduling problem with train delay in urban subway network. With the objective of minimizing the negative effect of train delay to passengers, which is quantified with a weighted combination of travel time cost and the cost of giving up the planned trips, train rescheduling model is proposed to jointly synchronize both train delay operation constraints and passenger behavior choices. Space–time network is proposed to describe passenger schedule‐based path choices and obtain the shortest travel times. Impatience time is defined to describe the intolerance of passengers to train delay. By comparing the increased travel time due to train delay with the passenger impatience time, a binary variable is defined to represent whether the passenger will give up their planned trips or not. The proposed train rescheduling model is implemented using genetic algorithm, and the model effectiveness is further examined through numerical experiments of real‐world urban subway train timetabling test. Duration effects of the train delay to the optimization results are analyzed. Copyright © 2017 John Wiley & Sons, Ltd.     

Improved waveform‐feature‐based vehicle classification using a single‐point magnetic sensor

Vehicle classification systems have important roles in applications related to real‐time traffic management. They also provide essential data and necessary information for traffic planning, pavement design, and maintenance. Among various classification techniques, the length‐based classification technique is widely used at present. However, the undesirable speed estimates provided by conventional data aggregation make it impossible to collect reliable length data from a single‐point sensor during real‐time operations. In this paper, an innovative approach of vehicle classification will be proposed, which achieved very satisfactory results on a single‐point sensor. This method has two essential parts. The first concerns with the procedure of smart feature extraction and selection according to the proposed filter–filter–wrapper model. The model of filter–filter–wrapper is adopted to make an evaluation on the extracted feature subsets. Meanwhile, the model will determine a nonredundant feature subset, which can make a complete reflection on the differences of various types of vehicles. In the second part, an algorithm for vehicle classification according to the theoretical basis of clustering support vector machines (C‐SVMs) was established with the selected optimal feature subset. The paper also uses particle swarm optimization (PSO), with the purpose of searching for an optimal kernel parameter and the slack penalty parameter in C‐SVMs. A total of 460 samples were tested through cross validation, and the result turned out that the classification accuracy was over 99%. In summary, the test results demonstrated that our vehicle classification method could enhance the efficiency of machine‐learning‐based data mining and the accuracy of vehicle classification. Copyright © 2014 John Wiley & Sons, Ltd.     

Modelling rain effects on risk‐taking behaviours of multi‐user classes in road networks with uncertainty

This paper proposes a new travel time reliability‐based traffic assignment model to investigate the rain effects on risk‐taking behaviours of different road users in networks with day‐to‐day demand fluctuations and variations in travel time. A generalized link travel time function is used to capture the rain effects on vehicle travel times and road conditions. This function is further incorporated into daily demand variations to investigate those travel time variations arising from demand uncertainty and rain condition. In view of these rain effects, road users' perception errors on travel times and risk‐taking behaviours on path choices are incorporated in the proposed model with the use of a logit‐based stochastic user equilibrium framework. This new model is formulated as a variational inequality problem in terms of path flows. A numerical example is used to illustrate the application of the proposed model for assessment of the rain effects on road networks with uncertainty.     

Development of a probabilistic model to optimize disseminated real‐time bus arrival information for pre‐trip passengers

In the advent of Advanced Traveler Information Systems (ATIS), the total wait time of passengers for buses may be reduced by disseminating real‐time bus arrival times for the next or series of buses to pre‐trip passengers through various media (e.g., internet, mobile phones, and personal digital assistants). A probabilistic model is desirable and developed in this study, while realistic distributions of bus and passenger arrivals are considered. The disseminated bus arrival time is optimized by minimizing the total wait time incurred by pre‐trip passengers, and its impact to the total wait time under both late and early bus arrival conditions is studied. Relations between the optimal disseminated bus arrival time and major model parameters, such as the mean and standard deviation of arrival times for buses and pre‐trip passengers, are investigated. Analytical results are presented based on Normal and Lognormal distributions of bus arrivals and Gumbel distribution of pre‐trip passenger arrivals at a designated stop. The developed methodology can be practically applied to any arrival distributions of buses and passengers.     

Modelling heavy vehicle car‐following behaviour in congested traffic conditions

This study develops a car‐following model in which heavy vehicle behaviour is predicted separately from passenger car. Heavy vehicles have different characteristics and manoeuvrability compared with passenger cars. These differences could create problems in freeway operations and safety under congested traffic conditions (level of service E and F) particularly when there is high proportion of heavy vehicles. With increasing numbers of heavy vehicles in the traffic stream, model estimates of the traffic flow could be degrades because existing car‐following models do not differentiate between these vehicles and passenger cars. This study highlighted some of the differences in car‐following behaviour of heavy vehicle and passenger drivers and developed a model considering heavy vehicles. In this model, the local linear model tree approach was used to incorporate human perceptual imperfections into a car‐following model. Three different real world data sets from a stretch of freeway in USA were used in this study. Two of them were used for the training and testing of the model, and one of them was used for evaluation purpose. The performance of the model was compared with a number of existing car‐following models. The results showed that the model, which considers the heavy vehicle type, could predict car‐following behaviour of drivers better than the existing models. Copyright © 2013 John Wiley & Sons, Ltd.     

A computational model for the probit‐based dynamic stochastic user optimal traffic assignment problem

This paper focuses on computational model development for the probit‐based dynamic stochastic user optimal (P‐DSUO) traffic assignment problem. We first examine a general fixed‐point formulation for the P‐DSUO traffic assignment problem, and subsequently propose a computational model that can find an approximated solution of the interest problem. The computational model includes four components: a strategy to determine a set of the prevailing routes between each origin–destination pair, a method to estimate the covariance of perceived travel time for any two prevailing routes, a cell transmission model‐based traffic performance model to calculate the actual route travel time used by the probit‐based dynamic stochastic network loading procedure, and an iterative solution algorithm solving the customized fixed‐point model. The Ishikawa algorithm is proposed to solve the computational model. A comparison study is carried out to investigate the efficiency and accuracy of the proposed algorithm with the method of successive averages. Two numerical examples are used to assess the computational model and the algorithm proposed. Results show that Ishikawa algorithm has better accuracy for smaller network despite requiring longer computational time. Nevertheless, it could not converge for larger network. Copyright © 2010 John Wiley & Sons, Ltd.