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.     

Optimizing coordinated transfer with probabilistic vehicle arrivals and passengers' walking time

Supporting efficient connections by synchronizing vehicle arrival time and passengers' walking time at a transfer hub may significantly improve service quality, stimulate demand, and increase productivity. However, vehicle travel times and walking times in urban settings often varies spatially and temporally due to a variety of factors. Nevertheless, the reservation of slack time and/or the justification of vehicle arrival time at the hub may substantially increase the success of transfer coordination. To this end, this paper develops a model that considers probabilistic vehicle arrivals and passengers walking speeds so that the slack time and the scheduled bus arrival time can be optimized by minimizing the total system cost. A case study is conducted in which the developed model is applied to optimize the coordination of multiple bus routes connecting at a transfer station in Xi'an, China. The relationship between decision variables and model parameters, including the mean and the standard deviation of walking time, is explored. It was found that the joint impact of probabilistic vehicle arrivals and passengers' walking time significantly affects the efficiency of coordinated transfer. The established methodology can essentially be applied to any distribution of bus arrival and passenger walking time. Copyright © 2017 John Wiley & Sons, Ltd.     

Optimal bus service patterns and frequencies considering transfer demand elasticity with genetic algorithm

This paper attempts to optimize bus service patterns (i.e., all-stop, short-turn, and express) and frequencies which minimize total cost, considering transfer demand elasticity. A mathematical model is developed based on the objective total cost for a generalized bus route, which is optimized subject to a set of constraints ensuring sufficient capacity, an operable bus fleet, and service frequency conservation. To optimize the integrated service of a bus route with many stops, which is a combinatorial optimization problem, a genetic algorithm is developed and applied to search for the solution. A case study, based on a real-world bus route in New Jersey, is conducted to demonstrate the applicability and effectiveness of the developed model and the solution algorithm. Results show that the proposed methodology is fairly efficient, and the optimized bus service significantly reduces total cost.     

Applying the Rasch measurement to explore elderly passengers' abilities and difficulties when using buses in Taipei

This study developed an approach for measuring elderly passengers' abilities and to explore their difficulties in accomplishing the actions and motions required to patronize the bus service. A conceptual framework about the required actions and motions in bus‐taking was established and a questionnaire with 18 items was designed to test their ability to use buses. A face‐to‐face survey was conducted to collect self‐rated information from 304 elderly bus passengers in Taipei. The Rasch model was applied to estimate the difficulty of each item and the ability of each person to use a bus. Results showed the relatively difficult items primarily involved keeping balance on the moving bus, reading the posted information at the station, and recognizing the buses approaching the stations; the levels of physical ability were negatively associated with the respondent's age. Suggestions are made based on improving the facilities or services to help the elderly passengers achieve the necessary actions or motions for using the bus service. Copyright © 2010 John Wiley & Sons, Ltd.     

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.     

Optimizing sustainable feeder bus operation considering realistic networks and heterogeneous demand

A mathematical model is developed to optimize social and fiscal sustainable operation of a feeder bus system considering realistic network and heterogeneous demand. The objective total profit is a nonlinear, mixed integer function, which is maximized by optimizing the number of stops, headway, and fare. The stops are located which maximize the ridership. The demand elasticity for the bus service is dependent on passengers' access distance, wait time, in‐vehicle time, and fare. An optimization algorithm is developed to search for the optimal solution that maximizes the profit. The modeling approach is applied to planning a bus transit system within Woodbridge, New Jersey. Copyright © 2011 John Wiley & Sons, Ltd.     

Train delay and perceived-wait time: passengers' perspective

Abstract

Waiting time influences the overall perception of service quality. The passenger-perceived waiting time can determine their waiting experience. The concept of waiting time refers to the comparison between the passengers' inherent tolerance of waiting and the possible improvement scenarios. This study investigates the passengers' tolerance of waiting under various scenarios of train delays in order to improve their perceived waiting time. We propose the adoption of a modern psychometric method utilizing the Rasch model to measure a subjective latent construct known as ‘wait tolerance'. The Rasch measurement provides mathematical procedures for transforming scores from an ordinal to an interval scale to observe which scenarios can reduce certain passengers' perceived waiting time in the case of a delay. Empirical results show that ‘uncontrollable circumstances', ‘friendly staff attitudes', and ‘providing appropriate messages of apology' can improve the passenger-perceived waiting time during train delays. Likewise, distinct differences are found in the passengers' tolerance of waiting in terms of various personal characteristics, such as gender, age, and train riding frequency. The findings propose the implementation of strategies for improvement by rail system operators, as well as for regulators to define a reasonable service level in the case of train delays. The reviews show possible future innovative research orientations as well.     

Frequency-based transit assignment considering seat capacities

This paper proposes a frequency-based assignment model that considers travellers probability of finding a seat in their perception of route cost and hence also their route choice. The model introduces a “fail-to-sit” probability at boarding points with travel costs based on the likelihood of travelling seated or standing. Priority rules are considered; in particular it is assumed that standing on-board passengers will occupy any available seats of alighting passengers before newly boarding passengers can fill any remaining seats. At the boarding point passengers are assumed to mingle, meaning that FIFO is not observed, as is the case for many crowded bus and metro stops, particularly in European countries. The route choice considers the common lines problem and an user equilibrium solution is sought through a Markov type network loading process and the method of successive averages. The model is first illustrated with a small example network before being applied to the inner zone of London’s underground network. The effect of different values passengers might attach to finding a seat are illustrated. Applications of the model for transit planning as well as for information provision at the journey planner stage are discussed.     

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.     

A mathematical model for headway variance of fixed-route buses

A mathematical model for computing and analysing headway variance of fixed-route buses offering scheduled service is developed. The model assumes a situation where both the passengers' OD pattern and the bus-route structure do not have any particular form but the number of passengers served at any bus station is a stationary Poisson process. Basic probability concepts are mostly used in deriving the model. Innovations in the model are the inclusion of a skip probability at a stop and the correlation factors between successive bus loads at a loading point and between the travel times of successive buses on a link. The model is, therefore, applicable to a wider range of situations than was possible with the earlier models. Results indicate that bus loading conditions and traffic conditions along the route are the major factors responsible for headway variability. The developed model can be used to determine the relative importance of these factors on headway variance at individual stopping station and thereby simplify the task of evolving effective countermeasures in any given situation. A numerical example that illustrates the application of the model is also given.     

Bus routing strategies in a transit market: A case study of Hong Kong

Conventionally, the objective of transit routing is often set either to minimize the total operational cost, subject to a given level of service quality, or to maximize the service quality at a given acceptable cost. In a deregulated, commercial‐based environment however, such as bus and railway operations in cities of the UK and Hong Kong where several private firms compete in route‐based or area‐based market, routing becomes one of the means for higher returns rather than just for cost saving. In such a case, how do the transit providers set up their routes for profit‐maximization? Will the routing based on the provider's objective meet the user's objective? How do government regulations and policies affect the choice of transit provider's routing strategy? To answer these questions, we first examine the relationship between the objectives of users and transit providers, set up criteria for transit routing quality, and then investigate the possible routing configurations/patterns for a hypothetical case. These criteria include (1) the load factor of transit, (2) the level of route directness, (3) the level of route overlapping, and (4) the total number of routes and (5) the average of route length. These measures are finally applied to a real case in Hong Kong to examine the route changes of Kowloon Motor Bus from 1975 to 1995. The result of the empirical case reveais how key measures such as load factor are controlled by the bus operator and affected by government policies and how the bus routing pattern was adjusted to meet users' need. Facing the dilemma as evident in Hong Kong between the route directness and the efficiency of road use, we suggest that a rational multi‐modal routing structure be put in place if an institutional solution is introduced so that bus and other transit modes can form a sharing program or an alliance.     

Optimal feeder bus routes on irregular street networks

The methodology presented here seeks to optimize bus routes feeding a major intermodal transit transfer station while considering intersection delays and realistic street networks. A model is developed for finding the optimal bus route location and its operating headway in a heterogeneous service area. The criterion for optimality is the minimum total cost, including supplier and user costs. Irregular and discrete demand distributions, which realistically represent geographic variations in demand, are considered in the proposed model. The optimal headway is derived analytically for an irregularly shaped service area without demand elasticity, with non‐uniformly distributed demand density, and with a many‐to‐one travel pattern. Computer programs are designed to analyze numerical examples, which show that the combinatory type routing problem can be globally optimized. The improved computational efficiency of the near‐optimal algorithm is demonstrated through numerical comparisons to an optimal solution obtained by the exhaustive search (ES) algorithm. The CPU time spent by each algorithm is also compared to demonstrate that the near‐optimal algorithm converges to an acceptable solution significantly faster than the ES algorithm.     

Disruption management in public transit: the bee colony optimization approach

Disruptions in carrying out planned bus schedules occur daily in many public transit companies. Disturbances are often so large that it is necessary to perform re-planning of planned bus and crew activities. Dispatchers in charge of traffic operations must frequently find an answer to the following question in a very short period of time: How should available buses be distributed among bus routes in order to minimize total passengers' waiting time on the network? We propose a model for assigning buses to scheduled routes when there is a shortage of buses. The proposed model is based on the bee colony optimization (BCO) technique. It is a biologically inspired method that explores collective intelligence applied by honey bees during the nectar collecting process. It has been shown that this developed BCO approach can generate high-quality solutions within negligible processing times.     

A reliability‐based traffic assignment model for multi‐modal transport network under demand uncertainty

In densely populated and congested urban areas, the travel times in congested multi‐modal transport networks are generally varied and stochastic in practice. These stochastic travel times may be raised from day‐to‐day demand fluctuations and would affect travelers' route and mode choice behaviors according to their different expectations of on‐time arrival. In view of these, this paper presents a reliability‐based user equilibrium traffic assignment model for congested multi‐modal transport networks under demand uncertainty. The stochastic bus frequency due to the unstable travel time of bus route is explicitly considered. By the proposed model, travelers' route and mode choice behaviors are intensively explored. In addition, a stochastic state‐augmented multi‐modal transport network is adopted in this paper to effectively model probable transfers and non‐linear fare structures. A numerical example is given to illustrate the merits of the proposed model. Copyright © 2012 John Wiley & Sons, Ltd.     

Statistical inference on transit route‐level origin–destination flows using automatic passenger counter data

We consider inferring transit route‐level origin–destination (OD) flows using large amounts of automatic passenger counter (APC) boarding and alighting data based on a statistical formulation. One critical problem is that we need to enumerate the OD flow matrices that are consistent with the APC data for each bus trip to evaluate the model likelihood function. The OD enumeration problem has not been addressed satisfactorily in the literature. Thus, we propose a novel sampler to avoid the need to enumerate OD flow matrices by generating them recursively from the first alighting stop to the last stop of the bus route of interest. A Markov chain Monte Carlo (MCMC) method that incorporates the proposed sampler is developed to simulate the posterior distributions of the OD flows. Numerical investigations on an operational bus route under a realistic OD structure demonstrate the superiority of the proposed MCMC method over an existing MCMC method and a state‐of‐the‐practice method. Copyright © 2015 John Wiley & Sons, Ltd.     

The allocation of buses in heavily utilized networks with overlapping routes

Many transit systems outside North America are characterized by networks with extensively overlapping routes and buses frequently operating at, or close to, capacity. This paper addresses the problem of allocating a fleet of buses between routes in this type of system; a problem that must be solved recurrently by transit planners. A formulation of the problem is developed which recognizes passenger route choice behavior, and seeks to minimize a function of passenger wait time and bus crowding subject to constraints on the number of buses available and the provision of enough capacity on each route to carry all passengers who would select it. An algorithm is developed based on the decomposition of the problem into base allocation and surplus allocation components. The base allocation identifies a feasible solution using an (approx.) minimum number of buses. The surplus allocation is illustrated for the simple objective of minimizing the maximum crowding level on any route. The bus allocation procedure developed in this paper has been applied to part of the Cairo bus system in a completely manual procedure, and is proposed to be the central element of a short-range bus service planning process for that city.     

A GIS‐based method to identify cost‐effective routes for rural deviated fixed route transit

Deviated fixed route transit (DFRT) service connecting rural and urban areas is a growing transportation mode in the USA. Little research has been done to develop frameworks for route design. A methodology to explore the most cost‐effective DFRT route is presented in this paper. The inputs include potential DFRT demand distribution and a road network. A heuristic is used to build possible routes by starting at urban cores and extending in all network directions in certain length increments. All the DFRT routes falling in the length range desired by the users are selected. The cost effectiveness of those routes, defined by operating cost per passenger trip, is compared. The most cost‐effective route is selected and presented in a GIS map. A case study illustrates the methodology in several Tennessee metropolitan regions. The most cost‐effective route length is case specific; some routes (e.g. those out of our Nashville case) are most cost effective when short, while others (e.g. those out of Memphis) are most cost effective when long. Government agencies could use the method to identify routes with the lowest operating cost per passenger given a route length or an operating cost budget. Copyright © 2016 John Wiley & Sons, Ltd.     

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.     

Passengers' perceptions and effects of bus‐holding strategy using automatic vehicle location technology

This study reports bus passengers' behavior and perceptions related to the use of potential features of an automatic vehicle location (AVL) system in bus transit through conducting an attitudinal on‐board survey in Bangkok. A passenger waiting‐time survey conducted as part of this study revealed that passengers perceive waiting‐time at bus stops to be greater than actually experienced. The other aim of this study is to examine the potential benefits of bus‐holding using an AVL technology, in terms of waiting‐time, through minimizing bus bunching under different congestion levels. The results are obtained using PARAMICS, and reveal a significant reduction in average waiting‐time.     

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.