Validation of a schedule‐based capacity restraint transit assignment model for a large‐scale network

This paper describes the application of a capacity restraint trip assignment algorithm to a real, large‐scale transit network and the validation of the results. Unlike the conventional frequency‐based approach, the network formulation of the proposed model is dynamic and schedule‐based. Transit vehicles are assumed to operate to a set of pre‐determined schedules. Passengers are assumed to select paths based on a generalized cost function including in‐vehicle and out‐of‐vehicle time and line change penalty. The time‐varying passenger demand is loaded onto the network by a time increment simulation method, which ensures that the capacity restraint of each vehicle during passenger boarding is strictly observed. The optimal‐path and path‐loading algorithms are applied iteratively by the method of successive averages until the network converges to the predictive dynamic user equilibrium. The Hong Kong Mass Transit Railway network is used to validate the model results. The potential applications of the model are also discussed.     

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 simulation‐based reliability assessment approach for congested transit network

This paper is an attempt to develop a generic simulation‐based approach to assess transit service reliability, taking into account interaction between network performance and passengers' route choice behaviour. Three types of reliability, say, system wide travel time reliability, schedule reliability and direct boarding waiting‐time reliability are defined from perspectives of the community or transit administration, the operator and passengers. A Monte Carlo simulation approach with a stochastic user equilibrium transit assignment model embedded is proposed to quantify these three reliability measures of transit service. A simple transit network with a bus rapid transit (BRT) corridor is analysed as a case study where the impacts of BRT components on transit service reliability are evaluated preliminarily.     

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.     

On seat capacity in traffic assignment to a transit network

Seating or standing make distinct on‐board states to a transit rider, yielding distinct discomfort costs, with potential influence on the passenger route choice onto the transit network. The paper provides a transit assignment model that captures the seating capacity and its occupancy along any transit route. The main assumptions pertain to: the seat capacity by service route, selfish user behaviour, a seat allocation process with priority rules among the riders, according to their prior state either on‐board or at boarding. To each transit leg from access to egress station is associated a set of ‘service modes’, among which the riders are assigned in a probabilistic way, conditionally on their priority status and the ratio between the available capacity and the flow of them. Thus the leg cost is a random variable, with mean value to be included in the trip disutility. Computationally efficient algorithms are provided for, respectively, loading the leg flows and evaluating the leg costs along a transit line. At the network level, a hyperpath formulation is provided for supply‐demand equilibrium, together with a property of existence and an method of successive averages equilibration algorithm. It is shown that multiple equilibria may arise. Copyright © 2010 John Wiley & Sons, Ltd.     

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.     

Planning for the unexpected: The value of reserve capacity for public transport network robustness

Public transport networks (PTN) are subject to recurring service disruptions. Most studies of the robustness of PTN have focused on network topology and considered vulnerability in terms of connectivity reliability. While these studies provide insights on general design principles, there is lack of knowledge concerning the effectiveness of different strategies to reduce the impacts of disruptions. This paper proposes and demonstrates a methodology for evaluating the effectiveness of a strategic increase in capacity on alternative PTN links to mitigate the impact of unexpected network disruptions. The evaluation approach consists of two stages: identifying a set of important links and then for each identified important link, a set of capacity enhancement schemes is evaluated. The proposed method integrates stochastic supply and demand models, dynamic route choice and limited operational capacity. This dynamic agent-based modelling of network performance enables to capture cascading network effects as well as the adaptive redistribution of passenger flows. An application for the rapid PTN of Stockholm, Sweden, demonstrates how the proposed method could be applied to sequentially designed scenarios based on their performance indicators. The method presented in this paper could support policy makers and operators in prioritizing measures to increase network robustness by improving system capacity to absorb unexpected disruptions.     

A methodology for choosing between fixed‐route and flex‐route policies for transit services

Flex‐route transit brings together the low cost operability of fixed‐route transit with the flexibility of demand responsive transit, and in recent years, it has become the most popular type of flexible transit service. In this paper, a methodology is proposed to help planners make better decisions regarding the choice between a conventional fixed‐route and a flex‐route policy for a specific transit system with a varying passenger demand. A service quality function is developed to measure the performance of transit systems, and analytical modeling and simulations are used to reproduce transit operation under the two policies. To be closer to reality, two criteria are proposed depending on the processing of rejected requests in the assessment of the service quality function for flex‐route services. In various scenarios, critical demand densities, which represent the switching points between the two competing policies, are derived in a real‐world transit service according to the two criteria. Copyright © 2014 John Wiley & Sons, Ltd.     

A dynamic stochastic model for evaluating congestion and crowding effects in transit systems

One of the most common motivations for public transport investments is to reduce congestion and increase capacity. Public transport congestion leads to crowding discomfort, denied boardings and lower service reliability. However, transit assignment models and appraisal methodologies usually do not account for the dynamics of public transport congestion and crowding and thus potentially underestimate the related benefits.This study develops a method to capture the benefits of increased capacity by using a dynamic and stochastic transit assignment model. Using an agent-based public transport simulation model, we dynamically model the evolution of network reliability and on-board crowding. The model is embedded in a comprehensive framework for project appraisal.A case study of a metro extension that partially replaces an overloaded bus network in Stockholm demonstrates that congestion effects may account for a substantial share of the expected benefits. A cost-benefit analysis based on a conventional static model will miss more than a third of the benefits. This suggests that failure to represent dynamic congestion effects may substantially underestimate the benefits of projects, especially if they are primarily intended to increase capacity rather than to reduce travel times.     

Transit assignment under crowded conditions

This paper presents a transit assignment algorithm for crowded networks. Both congestion in vehicles and queuing at stations are explicitly taken into account in predicting passenger flows for a fixed pattern of origin-destination trip demands. The overflow effects due to insufficient capacity of transit lines are considered to be concentrated at transit stations, while the in-vehicle congestion effects (or discomforts) are considered to be dependent on in-vehicle passenger volume. Overflow delay at a transit station is dependent on the number of excess passengers required to wait for the next transit car. We use a logit model to determine the split between passengers that chose to wait for the next transit car and passengers that chose to board on the alternative transit lines. The proposed algorithm predicts how passenger will choose their optimal routes under both queuing and crowded conditions.     

Activity-based market equilibrium for capacitated multimodal transport systems

Empirical studies have shown that demand for multimodal transport systems is highly correlated with activity schedules of individuals. Nonetheless, existing analytical equilibrium models of multimodal systems have only considered trip-based demand. We propose a new market equilibrium model that is sensitive to traveler activity schedules and system capacities. The model is based on a constrained mixed logit model of activity schedule choice, where each schedule in the choice set is generated with a multimodal extension of the household activity pattern problem. The extension explicitly accounts for both passenger choices of activity participation and multimodal choices like public transit, walking, and vehicle parking. The market equilibrium is achieved with Lagrangian relaxation to determine the optimal dual price of the capacity constraint, and a method of successive averages with column generation finds an efficient choice set of activity schedules to assign flows over the dynamic network load capacities. An example illustrates the model and algorithm, effects similar to Vickrey’s morning commute model can be observed as a special case. A case study of the Oakville Go Transit station access “last mile” problem in the Greater Toronto Area is conducted with 166 survey samples reflecting 3680 individuals. Results suggest that a $10 fixed parking fee at Oakville station would lead to a reduction of access auto share from 54.8% to 49.5%, an increase in access transit share from 20.7% to 25.9%, and a disutility increase of 11% for the of single-activity residents of Oakville.     

Scheduling considerations for a branching transit route

This paper addresses the impacts of different scheduling alternatives for a branching transit route. It examines different schedule alternatives that might be used to optimize the route performance in terms of the passenger traveling time distributed among branch passengers and trunk‐line passengers. The schedule alternatives considered include transit vehicle allocation to different branches, offset shifting across vehicles on different branches, and vehicle holding (slack time) in the transit vehicle schedule. With these variables, several vehicle schedules are devised and examined based on a wide variety of possible passenger boarding scenarios using deterministic service models. Test outcomes provide general conclusions about the performance of the strategies. Vehicle assignment leading to even headways among branches is generally preferred for the case of low passenger demand. However, when passenger demand is high, or the differences between the passenger demands on branches are significant, unequal vehicle assignment will be helpful to improve the overall route performance. Holding, as a proactive strategy in scheduling, has the potential to be embedded into the schedule as a type of slack time, but needs further evidence and study to determine the full set of conditions where it may be beneficial. Offset shifting does not show sufficient evidence to be an efficient strategy to improve route performance in the case of low or high passenger demand.     

Two-phase stochastic program for transit network design under demand uncertainty

This paper develops a reliability-based formulation for rapid transit network design under demand uncertainty. We use the notion of service reliability to confine the stochastic demand into a bounded uncertainty set that the rapid transit network is designed to cover. To evaluate the outcome of the service reliability chosen, flexible services are introduced to carry the demand overflow that exceeds the capacity of the rapid transit network such designed. A two-phase stochastic program is formulated, in which the transit line alignments and frequencies are determined in phase 1 for a specified level of service reliability; whereas in phase 2, flexible services are determined depending on the demand realization to capture the cost of demand overflow. Then the service reliability is optimized to minimize the combined rapid transit network cost obtained in phase 1, and the flexible services cost and passenger cost obtained in phase 2. The transit line alignments and passenger flows are studied under the principles of system optimal (SO) and user equilibrium (UE). We then develop a two-phase solution algorithm that combines the gradient method and neighborhood search and apply it to a series of networks. The results demonstrate the advantages of utilizing the two-phase formulation to determine the service reliability as compared with the traditional robust formulation that pre-specifies a robustness level.     

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.     

Modeling capacity flexibility of transportation networks

Flexibility of the transportation system is one of the important performance measures needed to deal with demand changes. In this paper, we provide a quantitative assessment of capacity flexibility for the passenger transportation network using bi-level network capacity models. Two approaches for assessing the value of capacity flexibility are proposed. One approach is based on the concept of reserve capacity, which reflects the flexibility with respect to changes in terms of demand volume only. The second approach allows for variations in the demand pattern in addition to changes in demand volume in order to more fully capture demand changes. Two models are developed in the second approach to consider two types of capacity flexibility. The total capacity flexibility allows all users to have both route choice and destination choice when estimating capacity flexibility. The limited capacity flexibility estimates how much more demand volume could be added to a fixed demand pattern by allowing the additional demand to deviate from the fixed demand pattern. Numerical examples are provided to demonstrate the different concepts of capacity flexibility for a passenger transportation system under demand changes.     

A model‐based demand‐balancing control for dynamically divided multiple urban subnetworks

Traffic control is an effective and efficient method for the problem of traffic congestion. It is necessary to design a high‐level controller to regulate the network traffic demands, because traffic congestion is not only caused by the improper management of the traffic network but also to a great extent caused by excessive network traffic demands. Therefore, we design a demand‐balance model predictive controller based on the macroscopic fundamental diagram‐based multi‐subnetwork model, which can optimize the network traffic mobility and the network traffic throughput by regulating the input traffic flows of the subnetworks. Because the transferring traffic flows among subnetworks are indirectly controlled and coordinated by the demand‐balance model predictive controller, the subnetwork division can variate dynamically according to real traffic states, and a global optimality can be achieved for the entire traffic network. The simulation results show the effectiveness of the proposed controller in improving the network traffic throughput. Copyright © 2016 John Wiley & Sons, Ltd.     

基于交通渗流理论的城市轨道交通网络动态服务瓶颈识别

为准确把握轨道交通网络化运营的新态势和新要求,力求轨道交通系统在大客流下做到运输能力和服务水平的供需匹配,需对轨道交通网络的关键瓶颈进行有效识别和疏解。本文借鉴交通渗流理论,提出了限制网络整体服务水平和连通效能的动态服务瓶颈的识别方法,该方法综合考虑了城市轨道交通系统的网络特性、客流特性和服务特性。其中针对区间服务水平状态,该方法提出了定量评定的复合指标模型。以成都地铁线网为案例,基于实际客流运营数据,构建动态网络,识别服务瓶颈,验证了方法的适用性和准确性,对城市轨道交通系统运营管理有实际指导意义。     

Optimization of grid bus transit systems with elastic demand

Current analytic models for optimizing urban bus transit systems tend to sacrifice geographic realism and detail in order to obtain their solutions. The models presented here shows how an optimization approach can be successful without oversimplifying spatial characteristics and demand patterns of urban areas and how a grid bus transit system in a heterogeneous urban environment with elastic demand is optimized. The demand distribution over the service region is discrete, which can realistically represent geographic variation. Optimal network characteristics (route and station spacings), operating headways and fare are found, which maximize the total operator profit and social welfare. Irregular service regions, many‐to‐many demand patterns, and vehicle capacity constraints are considered in a sequential optimization process. The numerical results show that at the optima the operator profit and social welfare functions are rather flat with respect to route spacing and headway, thus facilitating the tailoring of design variables to the actual street network and particular operating schedule without a substantial decrease in profit. The sensitivities of the design variables to some important exogenous factors are also presented.     

Public transit service operation strategy under indifference thresholds‐based bi‐modal equilibrium

This paper investigates public transit service (fare and frequency) operation strategies in a bi‐modal network with assumption of indifference thresholds‐based travelers' mode choice behavior. Under such behavior, users would switch to a new mode only if its utility is larger than the utility of current mode plus a threshold. The concept of indifference thresholds‐based bi‐modal equilibrium (ITBE) and the properties of the ITBE solution are explicitly proposed. Considering transit operator's different economic objectives (profit‐maximizing, no‐deficit and total system cost‐minimizing), the effect of indifference thresholds on transit fare and frequency schemes is studied. Some numerical experiments are accompanied to verify the theoretical results. Copyright © 2016 John Wiley & Sons, Ltd.     

Pick‐up locations and bus allocation for transit‐based evacuation planning with demand uncertainty

This paper develops a decision‐support model for transit‐based evacuation planning under demand uncertainty. Demand uncertainty refers to the uncertainty associated with the number of transit‐dependent evacuees. A robust optimization model is proposed to determine the optimal pick‐up points for evacuees to assemble, and allocate available buses to transport the assembled evacuees between the pick‐up locations and different public shelters. The model is formulated as a mixed‐integer linear program and is solved via a cutting plane scheme. The numerical example based on the Sioux Falls network demonstrates that the robust plan yields lower total evacuation time and is reliable in serving the realized evacuee demand. Copyright © 2012 John Wiley & Sons, Ltd.