A computer model for finding the time-dependent minimum path in a transit system with fixed schedules

This paper describes the development of a computer model and algorithms for finding the time-dependent minimum path between two stations in a multi-route, multi-mode transit system running to fixed schedules. Selection of the minimum path can be based either on journey time or on weighted time. A worked example using a simple transit network is given to illustrate how the model works. The model has several applications in transport planning: it can be used for generating route schedule information to guide transit users, for assisting in route schedule coordination, and for analyzing transit system accessibility.     

Modeling schedule recovery processes in transit operations for bus arrival time prediction

Many existing algorithms for bus arrival time prediction assume that buses travel at free‐flow speed in the absence of congestion. As a result, delay incurred at one stop would propagate to downstream stops at the same magnitude. In reality, skilled bus operators often constantly adjust their speeds to keep their bus on schedule. This paper formulates a Markov chain model for bus arrival time prediction that explicitly captures the behavior of bus operators in actively pursuing schedule recovery. The model exhibits some desirable properties in capturing the schedule recovery process. It guarantees provision of the schedule information if the probability of recovering from the current schedule deviation is sufficiently high. The proposed model can be embedded into a transit arrival time estimation model for transit information systems that use both real‐time and schedule information. It also has the potential to be used as a decision support tool to determine when dynamic or static information should be used.     

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 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.     

Time control point strategy coupled with transfer coordination in bus schedule design

A schedule consisting of an appropriate arrival time at each time control point can ensure reliable transport services. This paper develops a novel time control point strategy coupled with transfer coordination for solving a multi‐objective schedule design problem to improve schedule adherence and reduce intermodal transfer disutility. The problem is formulated using a robust mixed‐integer nonlinear programming model. The mixed‐integer nonlinear programming model is equivalently transformed into a robust mixed‐integer linear programming model, which is then approximated by a deterministic mixed‐integer linear programming model through Monte Carlo simulation. Thus, the optimal scheduled arrival time at each time control point can be precisely obtained using cplex . Numerical experiments based on three bus lines and the mass rapid transit system in Singapore are presented, and the results show that the schedule determined using the developed model is able to provide not only reliable bus service but also a smooth transfer experience for passengers. Copyright © 2016 John Wiley & Sons, Ltd.     

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.     

Design and development of interactive trip planning for web-based transit information systems

This article presents a Web-based transit information system design that uses Internet Geographic Information Systems (GIS) technologies to integrate Web serving, GIS processing, network analysis and database management. A path finding algorithm for transit network is proposed to handle the special characteristics of transit networks, e.g., time-dependent services, common bus lines on the same street, and non-symmetric routing with respect to an origin/destination pair. The algorithm takes into account the overall level of services and service schedule on a route to determine the shortest path and transfer points. A framework is created to categorize the development of transit information systems on the basis of content and functionality, from simple static schedule display to more sophisticated real time transit information systems. A unique feature of the reported Web-based transit information system is the Internet-GIS based system with an interactive map interface. This enables the user to interact with information on transit routes, schedules, and trip itinerary planning. Some map rendering, querying, and network analysis functions are also provided.     

An analysis of the commuter departure time decision

Transportation planners and transit operators alike have become increasingly aware of the need to diffuse the concentration of peak period travel in an effort to improve gasoline economy and reduce peak load requirements. An evaluation of the potential effectiveness of strategies directed to achieve this end requires an understanding of factors which affect commuter trip timing decisions. The research discussed in this article addresses this particular problem through the development and estimation of a commuter departure time (to work) choice model.A number of conclusions were drawn based on the departure time model results and related analyses. It was found that work schedule flexibility, mode, occupation, income, age, and transportation level of service all influence departure time choice. The uncertainty in work arrival time and the consequences of various work arrival times may also be determinants of commuter departure time choice.The estimated model represents improvements over previous work in that it more explicitly considers work arrival time uncertainty and travelers' perceived loss associated with varying work arrival times, and additional socio-demographic factors which can potentially affect departure time choice. Furthermore, the estimated model includes consideration of transit commuters, in addition to single occupant auto and carpool work travelers. The inclusion of transit commuters represents a particularly important contribution for policy analysis, since the model could potentially be used to study the effect of service and employment policies on transit system peak load requirements.     

Analyzing transit service reliability using detailed data from automatic vehicular locator systems

The widespread adoption of automated vehicle location (AVL) systems and automatic passenger counters (APCs) in the transit industry has opened new venues in operations and system monitoring. In 2005, Metro Transit, Minnesota, implemented AVL system and partially implemented APC technologies. To date there has been little effort to employ the collected data in evaluating transit performance. This research uses such data to assess performance issues along a cross‐town route in the Metro Transit system. We generate a series of visual and analytical analyses to predict run time, schedule adherence and reliability of the transit route at two scales: the time point segment and the route level to demonstrate ways of identifying causes of decline in reliability levels. The analytical models show that while headways are maintained, schedule revisions are needed to improve run time and schedule adherence. Finally, the analysis suggests that many scheduled stops along this route are underutilized and recommends stop consolidation as a tool to decrease variability of service through concentrating passenger demand along a fewer number of stops. Copyright © 2010 John Wiley & Sons, Ltd.     

Mitigation of disruptions in public transit by Bee Colony Optimization

Dispatchers in many public transit companies face the daily problem of assigning available buses to bus routes under conditions of bus shortages. In addition to this, weather conditions, crew absenteeism, traffic accidents, traffic congestion and other factors lead to disturbances of the planned schedule. We propose the Bee Colony Optimization (BCO) algorithm for mitigation of bus schedule disturbances. The developed model takes care of interests of the transit operator and passengers. The model reassigns available buses to bus routes and, if it is allowed, the model simultaneously changes the transportation network topology (it shortens some of the planned bus routes) and reassigns available buses to a new set of bus routes. The model is tested on the network of Rivera (Uruguay). Results obtained show that the proposed algorithm can significantly mitigate disruptions.     

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 fare and headway to facilitate timed transfer considering demand elasticity

Fare and service frequency significantly affect transit users’ willingness to ride, as well as the supplier's revenue and operating costs. To stimulate demand and increase productivity, it is desirable to reduce the transfer time from one route to another via efficient service coordination, such as timed transfer. Since demand varies both temporally and spatially, it may not be cost-effective to synchronize vehicle arrivals on all connecting routes at a terminal. In this paper, we develop a schedule coordination model to optimize fare and headway considering demand elasticity. The headway of each route is treated as an integer-multiple of a base common headway. A discounted (reduced) fare is applied as an incentive to encourage ridership and, thus, stimulate public transit usage. The objective of the proposed coordination model is used to maximize the total profit subject to the service constraint. A numerical example is given to demonstrate the applicability of the proposed model. The results show that the optimized fare and headway may be carefully applied to yield the maximum profit. The relationship between the decision variables and model parameters is explored in the sensitivity analysis.     

Mesoscopic simulation for transit operations

This paper presents a transit simulation model designed to support evaluation of operations, planning and control, especially in the context of Advanced Public Transportation Systems (APTS). Examples of potential applications include frequency determination, evaluation of real-time control strategies for schedule maintenance and assessing the effects of vehicle scheduling on the level of service. Unlike most previous efforts in this area, the simulation model is built on a platform of a mesoscopic traffic simulation model, which allows modeling of the operation dynamics of large-scale transit systems taking into account the stochasticity due to interactions with road traffic. The capabilities of Mezzo as an evaluation tool of transit operations are demonstrated with an application to a real-world high-demand bus line in the Tel-Aviv metropolitan area under various scenarios. The headway distributions at two stops are compared with field observations and show good consistency between simulated and observed data.     

An investigation on the performances of mode shift models in transit ridership forecasting

This paper aims at investigating the over-prediction of public transit ridership by traditional mode choice models estimated using revealed preference data. Five different types of models are estimated and analysed, namely a traditional Revealed Preference (RP) data-based mode choice model, a hybrid mode choice model with a latent variable, a Stated Preference (SP) data-based mode switching model, a joint RP/SP mode switching model, and a hybrid mode switching model with a latent variable. A comparison of the RP data-based mode choice model with the mode choice models including a latent variable showed that the inclusion of behavioural factors (especially habit formation) significantly improved the models. The SP data-based mode switching models elucidated the reasons why traditional models tend to over-predict transit ridership by revealing the role played by different transit level-of-service attributes and their relative importance to mode switching decisions. The results showed that traditional attributes (e.g. travel cost and time) are of lower importance to mode switching behaviour than behavioural factors (e.g. habit formation towards car driving) and other transit service design attributes (e.g. crowding level, number of transfers, and schedule delays). The findings of this study provide general guidelines for developing a variety of transit ridership forecasting models depending on the availability of data and the experience of the planner.     

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.     

Bus maintenance systems and maintenance scheduling: model formulations and solutions

This paper deals with the problem of scheduling bus maintenance activities. The scheduling of maintenance activities is an important component in bus transit operations planning process. The other components include network route design, setting timetables, scheduling vehicles, and assignment of drivers. This paper presents a mathematical programming approach to the problem. This approach takes as input a given daily operating schedule for all buses assigned to a depot along with available maintenance resources. It, then, attempts to design daily inspection and maintenance schedules for the buses that are due for inspection so as to minimize the interruptions in the daily bus operating schedule, and maximize the utilization of the maintenance facilities. Three integer programming formulations are presented and different properties of the problem are discussed. Several heuristic methods are presented and tested. Some of these procedures produce very close to optimal solutions very efficiently. In some cases, the computational times required to obtain these solutions are less than 1% of the computational time required for the conventional branch and bound algorithm. Several small examples are offered and the computational results of solving the problem for an actual, 181-bus transit property are reported.     

The evening commute with cars and transit: Duality results and user equilibrium for the combined morning and evening peaks

This paper extends Vickrey’s (1969) commute problem for commuters wishing to pass a bottleneck for both cars and transit that share finite road capacity. In addition to this more general framework considering two modes, the paper focuses on the evening rush, when commuters travel from work to home. Commuters choose which mode to use and when to travel in order to minimize the generalized cost of their own trips, including queueing delay and penalties for deviation from a preferred schedule of arrival and departure to and from work. The user equilibrium for the isolated morning and evening commutes are shown to be asymmetric because the schedule penalty in the morning is the difference between the departure and wished curves, and the schedule penalty in the evening is the difference between the arrival and wished curves. It is shown that the system optimum in the morning and evening peaks are symmetric because queueing delay is eliminated and the optimal arrival curves are the same as the departure curves.The paper then considers both the morning and evening peaks together for a single mode bottleneck (all cars) with identical travelers that share the same wished times. For a schedule penalty function of the morning departure and evening arrival times that is positive definite and has certain properties, a user equilibrium is shown to exist in which commuters travel in the same order in both peaks. The result is used to illustrate the user equilibrium for two cases: (i) commuters have decoupled schedule preferences in the morning and evening and (ii) commuters must work a fixed shift length but have flexibility when to start. Finally, a special case is considered with cars and transit: commuters have the same wished order in the morning and evening peaks. Commuters must use the same mode in both directions, and the complete user equilibrium solution reveals the number of commuters using cars and transit and the period in the middle of each rush when transit is used.     

Estimation of the perceived value of transit time for containerized cargoes

This paper proposes a novel method for estimating the perceived value of transit time of containers by shipping lines. The key idea is that a shipping line’s published schedule is the optimal decision that minimizes the sum of fuel cost and time-associated costs of the containers adopted by the shipping line. Using the proposed method, we find that the adopted values of transit time for nine trans-Pacific services operated by Orient Overseas Container Line and five trans-Pacific services operated by Maersk Line are between US$5/TEU/day and US$30/TEU/day. We further demonstrate how the adopted value can be used for designing the optimal transit times between ports, analyzing the viability of slow-steaming, checking whether ships should speed up to catch up to connecting ships on other services, and helping to predict the market share of less polluting fuels in view of rules on air emission.     

The importance of time in transit and reliability of transit time for shippers,receivers, and carriers

Reliability of transit time is reputed to be the most important variable influencing freight transport today, according to shipper surveys. Average transit time also plays a major role. A model is developed that shows how a cost-minimizing shipper will adjust its economic order quantity as reliability and/or time in transit changes. Such changes impact on average inventory costs, ordering costs, expected shortage costs and expected excess costs. The model is developed for both discrete and continuous transit time distributions. Reliability is defined as the variance of transit time. A matrix is prepared for some sample data, which shows the minimum cost attainable with each mean/variance of transit time distribution. Comparing across rows and columns of the matrix enables one to show the value (reduction in total cost) obtainable by improving reliability and/or mean transit time. In addition, value can be obtained by improving reliability while increasing average transit time. It is suggested that the model can be used for shippers in negotiating service improvements with carriers and by carriers in negotiating service improvements with shippers. In the former case, the carrier can determine how much they are willing to pay for the improvement, whereas in the latter case, the carriers can determine how much they are able to charge for the improvement.     

Flexing service schedules: Assessing the potential for demand-adaptive hybrid transit via a stated preference approach

This paper assesses the demand for a flexible, demand-adaptive transit service, using the Chicago region as an example. We designed and implemented a stated-preference survey in order to (1) identify potential users of flexible transit, and (2) inform the service design of the flexible transit mode. Multinomial logit, mixed-logit, and panel mixed-logit choice models were estimated using the data obtained from the survey. The survey instrument employed a d_p-efficient design and the Google Maps API to capture precise origins and destinations in order to create realistic choice scenarios. The stated-preference experiments offered respondents a choice between traditional transit, car, and a hypothetical flexible transit mode. Wait time, access time, travel time, service frequency, cost, and number of transfers varied across the choice scenarios. The choice model results indicate mode-specific values of in-vehicle travel time ranging between $16.3 per hour (car) and $21.1 per hour (flexible transit). The estimated value of walking time to transit is $25.9 per hour. The estimated value of waiting time at one’s point of origin for a flexible transit vehicle is $11.3 per hour; this value is significantly lower than the disutility typically associated with waiting at a transit stop/station indicating that the ‘at-home’ pick-up option of flexible transit is a highly desirable feature. The choice model results also indicate that respondents who use active-transport modes or public transit for their current commute trip, or are bikeshare members, were significantly more likely to choose flexible and traditional transit than car commuters in the choice experiments. The implications of these and other relevant model results for the design and delivery of flexible, technology-enabled services are discussed.