Optimal slack time for timed transfers at a transit terminal

At transit terminals where two routes interchange passengers, total system costs may be reduced by allowing some “slack” time in the vehicle schedules to decrease the probability of missed connections. Transfer cost functions are formulated and used to determine optimal slack time for simple systems with transfers between one bus route and one rail line. Some analytic results are derived for empirical discrete and Gumbel distributions of bus arrival times. Relations between the optimal slack times and headways, transfer volumes, passenger time values, bus operating costs, and standard deviations of bus and train arrivals are also developed numerically using normally distributed arrivals. However, the proposed numerical approach can optimize slack times for any observed arrival distributions. The results provide some guidelines on desirable slack times and show that schedule coordination between the two routes is not worth attempting when standard deviations of arrivals exceed certain levels. Possible extensions of this work are suggested in the last section.     

Modeling and simulation of vehicle projection arrival–discharge process in adaptive traffic signal controls

Real‐time signal control operates as a function of the vehicular arrival and discharge process to satisfy a pre‐specified operational performance. This process is often predicted based on loop detectors placed upstream of the signal. In our newly developed signal control for diamond interchanges, a microscopic model is proposed to estimate traffic flows at the stop‐line. The model considers the traffic dynamics of vehicular detection, arrivals, and departures, by taking into account varying speeds, length of queues, and signal control. As the signal control is optimized over a rolling horizon that is divided into intervals, the vehicular detection for and projection into the corresponding horizon intervals are also modeled. The signal control algorithm is based on dynamic programming and the optimization of signal policy is performed using a certain performance measure involving delays, queue lengths, and queue storage ratios. The arrival–discharge model is embedded in the optimization algorithm and both are programmed into AIMSUN, a microscopic stochastic simulation program. AIMSUN is then used to simulate the traffic flow and implement the optimal signal control by accessing internal data including detected traffic demand and vehicle speeds. Sensitivity analysis is conducted to study the effect of selecting different optimization criteria on the signal control performance. It is concluded that the queue length and queue storage ratio are the most appropriate performance measures in real‐time signal control of interchanges. Copyright © 2010 John Wiley & Sons, Ltd.     

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.     

A probabilistic model for traffic at actuated control signals

Vehicle actuated controls are designed to adapt green and red times automatically, according to the actual dynamics of the arrival, departure and queuing processes. In turn, drivers experience variable delays and waiting times at these signals. However, in practice, delays and waiting times are computed at these systems with models that assume stationariety in the arrival process, and that are capable of computing simply expectation values, while no information is given on the uncertainty around this expectation. The growing interest on measures like travel time reliability, or network robustness motivates the development of models able to quantify the variability of traffic at these systems.This paper presents a new modeling approach for estimating queues and signal phase times, based on probabilistic theory. This model overcomes the limitations of existing models in that it does not assume stationary arrival rates, but it assumes any temporal distribution as input, and allows one to compute the temporal evolution of queue length and signal sequence probabilities. By doing so, one can also quantify the uncertainty in the estimation of delays and waiting times as time-dependent processes. The results of the probabilistic approach have been compared to the results of repeated microscopic simulations, showing good agreement. The smaller number of parameters and shorter computing times required in the probabilistic approach makes the model suitable for, e.g., planning and design problems, as well as model-based travel time estimation.     

A ‘Less-flexibility-first’ Heuristic for the Placement of Inland Vessels in a Lock

Abstract

Inland vessels move goods along waterways (canals and rivers) and they visit ports. Because of their tidal nature, vessels make use of locks to enter ports or waterways. From a port management point of view, fast access to and from the port and high utilization of locks are important objectives. Where the former relates to low inbound and outbound waiting times, the latter relates to the placement of as many vessels as possible in the lock before its operation. This article includes a case study that relates to the operation of the Van Cauwelaert lock in the port of Antwerp, Belgium. Lock operation policy is as follows: vessels wait in front of the lock for a port administrator to assign places in the lock based on knowledge of the vessels’ dimensions. As such, there is no FIFO-discipline, but a ‘group-FIFO’-discipline, i.e. if n vessels are allowed into the lock, they are the first n vessels in the arrival queue. A heuristic algorithm is formulated for the placement of vessels in the lock. This algorithm supports the decision where to place the vessel in the lock, aiming to place as many vessels as possible from the arrival queue. At the same time, it supports the decision to start a locking operation or not, based on information about vessels that are announced but which have not yet arrived at the lock's entrance. The heuristic is called a ‘less-flexibility-first’-heuristic as it looks for pseudo-placements, showing which flexibility is left for the remaining vessels after placing a vessel. This article describes the implementation of the heuristic and provides numerical examples. A comparison is made between the heuristic results and daily practice, based on real-life vessel movements through the Van Cauwelaert lock in 2002.     

Appraisal of traffic stream friction

This paper presents a simulation model to evaluate the quality of traffic flow. The evaluation is based on counts of the number of potential speed changes on a stretch of road and the estimated number of times a vehicle is limited in changing lanes. In order to describe the behaviour of the traffic flow process, two models were developed. One model describes vehicle arrival patterns on a road cross section; the other model, vehicle speeds. The stochastic process of speed is described as an autoregression process, whereas vehicle arrivals are presented as a Markovian process. Simulation results indicate an increase in traffic stream friction with an increase in vehicle-speed standard deviation and a reduction in average speed. The dependence of vehicle arrivals in adjacent lanes seems to increase the amount of friction in each lane. The simulation model developed enables a comparison of the quality of traffic flow at different sites, as well as a before-and-after study of any particular site.     

Signalized intersections with variable flow rates: II A model for delay estimation

This second part of our work develops a model for delay estimation at intersections whose traffic signal controls are continuously being updated. Generally, these traffic signals are centrally controlled. The foundation for the delay estimation model is based on a queuing theory model called “Preemptive resume discipline for M/G/1 with two priority levels.” This queuing model assumes that two customers arrive at acertain point by a Poisson arrival process, and that one customer has service priority over the second customer. The analogy for the case of intersection control is that the preferred customers are the red lights and the secondary customers are the vehicles. In order to adapt the model to the realistic behavior of vehicle traffic at continuously adjusted signals, components are derived to modify the model. The simulation results of the first part of this work are used to calculate adjustment factors that fairly accurately reproduce the simulated delays. This gives rise to the advantage of using in practice a closed mathematical model, in particular when trying to optimize the operation of signalized intersections at the network level.     

The effect of green time on stochastic queues at traffic signals

Many analyses of traffic signal queues use Webster and Cobbe's formula, which combines the net effect of the red/green cycle with a term representing stochastic effects, idealised as an M/D/1 queue process having random arrivals and uniform service. Several authors have noted that this component should depend not only on demand intensity but also on throughput capacity in each green period, although an extra empirical term may partially allow for this. Extending the service interval in M/D/1 (M = Markovian, i.e. random, D = deterministic, i.e. uniform, 1 = one server) enables the effect to be reproduced, but no exact expressions for its moments are found. Approximate formulae for the extended mean exist but are accurate only near saturation. The paper derives novel approximations for the equilibrium mean and also variance and utilisation, using functions linking traffic intensity with green period capacity. With three moments, equilibrium probability distributions can be estimated for which a method based on a doubly nested geometric distribution is described.     

Real-time queue length estimation for congested signalized intersections

How to estimate queue length in real-time at signalized intersection is a long-standing problem. The problem gets even more difficult when signal links are congested. The traditional input–output approach for queue length estimation can only handle queues that are shorter than the distance between vehicle detector and intersection stop line, because cumulative vehicle count for arrival traffic is not available once the detector is occupied by the queue. In this paper, instead of counting arrival traffic flow in the current signal cycle, we solve the problem of measuring intersection queue length by exploiting the queue discharge process in the immediate past cycle. Using high-resolution “event-based” traffic signal data, and applying Lighthill–Whitham–Richards (LWR) shockwave theory, we are able to identify traffic state changes that distinguish queue discharge flow from upstream arrival traffic. Therefore, our approach can estimate time-dependent queue length even when the signal links are congested with long queues. Variations of the queue length estimation model are also presented when “event-based” data is not available. Our models are evaluated by comparing the estimated maximum queue length with the ground truth data observed from the field. Evaluation results demonstrate that the proposed models can estimate long queues with satisfactory accuracy. Limitations of the proposed model are also discussed in the paper.     

Intermodal Transit System Coordination

In urban areas where transit demand is widely spread, passengers may be served by an intermodal transit system, consisting of a rail transit line (or a bus rapid transit route) and a number of feeder routes connecting at different transfer stations. In such a system, passengers may need one or more transfers to complete their journey. Therefore, scheduling vehicles operating in the system with special attention to reduce transfer time can contribute significantly to service quality improvements. Schedule synchronization may significantly reduce transfer delays at transfer stations where various routes interconnect. Since vehicle arrivals are stochastic, slack time allowances in vehicle schedules may be desirable to reduce the probability of missed connections. An objective total cost function, including supplier and user costs, is formulated for optimizing the coordination of a general intermodal transit network. A four-stage procedure is developed for determining the optimal coordination status among routes at every transfer station. Considering stochastic feeder vehicle arrivals at transfer stations, the slack times of coordinated routes are optimized, by balancing the savings from transfer delays and additional cost from slack delays and operating costs. The model thus developed is used to optimize the coordination of an intermodal transit network, while the impact of a range of factors on coordination (e.g., demand, standard deviation of vehicle arrival times, etc) is examined.     

Dynamic vehicular delay comparison between a police-controlled roundabout and a traffic signal

Effects of queues on motorists during rush hours are severe at intersections controlled by roundabouts. Traffic police are frequently used in order to optimize the traffic flow and to control queue length at such intersections. However, the question as to how efficient such system is, compared with traffic signal, is not clear from the dynamic delay point of view. In this study a criterion is being developed based on vehicular delays as the motorist join the queues and cross the stop-line. The adopted method avoids oversimplification of reality and prevents unrealistic assumptions. The data required for the study were mainly collected through video filming technique. The results, for a given set of geometric and traffic characteristics, indicate that both a police-controlled roundabout and a traffic signal act in a similar manner in terms of vehicular delay at a certain critical value. This critical value is considered to be the point of intersection between the curves representing traffic signal and roundabout on a delay–space diagram for the vehicles as they join the tail end of the queue until they cross the stop-line. Beyond the critical value, the effect of delays and buildup of queues at roundabouts will be excessive, compared to traffic signals. Before the critical value the delays at traffic signals are quite high compared to roundabouts. The study will assist the concerned authorities to operate the existing conditions, particularly the roundabouts, more efficiently. It will also be beneficial for the traffic planners and policy makers in making judicious decisions regarding control type at intersections.     

A Heuristic Algorithm for the Allocation of Airport Runway System Capacity

Abstract

This paper develops a heuristic algorithm for the allocation of airport runway capacity to minimise the cost of arrival and departure aircraft/flight delays. The algorithm is developed as a potential alternative to optimisation models based on linear and integer programming. The algorithm is based on heuristic (‘greedy’) criteria that closely reflect the ‘rules of thumb’ used by air traffic controllers. Using inputs such as arrival and departure demand, airport runway system capacity envelopes and cost of aircraft/flight delays, the main output minimises the cost of arrival and departure delays as well as the corresponding interdependent airport runway system arrival and departure capacity allocation. The algorithm is applied to traffic scenarios at three busy US airports. The results are used to validate the performance of the proposed heuristic algorithm against results from selected benchmarking optimisation models.     

Operational impacts of incident quick clearance legislation: a simulation analysis

Many states in the US have enacted quick clearance laws requiring drivers of vehicles involved in minor incidents to move their vehicles from travel lanes prior to the arrival of first responders. Since little is known about the effectiveness of these laws, this research sought to find the benefit–cost ratio of advertising quick clearance legislation to improve driver compliance, and compare it with benefit–cost ratios of other incident management strategies, particularly traffic cameras, freeway service patrols, and traffic sensors. The analysis used traffic simulation that applied application programming interfaces to produce random spatial and temporal occurrence of incidents, including incident start times, durations, and locations, based on normal distributions developed from field data, to test before and after the law scenarios. The results provide decision makers with support for prioritizing funding between these incident management strategies and indicated that investments in the advertisement of this law was beneficial. Copyright © 2011 John Wiley & Sons, Ltd.     

Signalized intersections with variable flow rates: I analysis and simulation

One of the most common measures of signalized intersection operation is the amount of delay a vehicle incurs while passing through the intersection. Traditional models for estimating vehicle delay at intersections generally assume fixed signal timing and uniform arrival rates for vehicles approaching the intersection. One would expect that highly variable arrival rates would result in much longer delays than uniform arrival rates of the same average magnitude. Furthermore, one might expect that signal timing that is adjusted according to traffic volume would result in lower delay signal when variations in flow warrant such adjustable timing. This paper attempts to test several hypotheses concerning the effects of variable traffic arrival rates and adjusted signal timing through the use of simulation. The simulation results corroborate the hypothesis concerning the effect of varying arrival rates. As the variance of the arrival rate over time increases, the average delay per vehicle also increases. Signal timing adjustments based on traffic appear to decrease delay when flow rates vary greatly. As flow variations stabilize, the benefits of signal adjustments tend to diminish.     

Numerical simulation of transient bulk queues with general vehicle dispatching strategies

Relatively simple iterative procedures are developed for simulating the queue length distribution for transient bulk arrival, bulk service queues. The method allows the study of holding strategies where the length of time a vehicle is held can depend on both the length ofthe queue and how long the vehicle has been held. The system is modeled in discrete time, and a series of numerical experiments are presented that examine the errors introduced by this discretization.     

Predicting queue variability to enable analysis of overload risk

ABSTRACT

Predicting the risk of traffic demands and delays exceeding critical limits at road junctions, airports, hospitals, etc., requires knowing how both mean and variance of queue size vary over time. Microscopic simulation can explore variability but is computationally demanding and gives only sample results. A computationally efficient approximation to the mean is used in many modelling tools, but only empirical extensions for variance in particular situations have been available. The paper derives theoretical formulae for time-dependent and equilibrium variance, believed to be novel and to apply generally to queues covered by the Pollaczek–Khinchin mean formula, and offering possible structural insights. These are applied in an extended approximation giving mutually consistent mean and variance estimates with improved accuracy. Tests on oversaturated peak demand cases are compared with Markov probabilistic simulation, demonstrating accuracy (R^2?>?0.99) for typical random, priority-like (M/M/1) and traffic-signal-like (M/D/1) queues. Implications for risk analysis, planning and policy are considered.     

Passenger arrival and waiting time distributions dependent on train service frequency and station characteristics: A smart card data analysis

Waiting time at public transport stops is perceived by passengers to be more onerous than in-vehicle time, hence it strongly influences the attractiveness and use of public transport. Transport models traditionally assume that average waiting times are half the service headway by assuming random passenger arrivals. However, research agree that two distinct passenger behaviour types exist: one group arrives randomly, whereas another group actively tries to minimise their waiting time by arriving in a timely manner at the scheduled departure time. This study proposes a general framework for estimating passenger waiting times which incorporates the arrival patterns of these two groups explicitly, namely by using a mixture distribution consisting of a uniform and a beta distribution. The framework is empirically validated using a large-scale automatic fare collection system from the Greater Copenhagen Area covering metro, suburban, and regional rail stations thereby giving a range of service headways from 2 to 60 min. It was shown that the proposed mixture distribution is superior to other distributions proposed in the literature. This can improve waiting time estimations in public transport models. The results show that even at 5-min headways 43% of passengers arrive in a timely manner to stations when timetables are available. The results bear important policy implications in terms of providing actual timetables, even at high service frequencies, in order for passengers to be able to minimise their waiting times.     

Modeling the time to the next primary and secondary incident: A semi-Markov stochastic process approach

Incidents are notorious for their delays to road users. Secondary incidents – i.e., incidents that occur within a certain temporal and spatial distance from the first/primary incident – can further complicate clearance and add to delays. While there are numerous studies on the empirical analysis of incident data, to the best of our knowledge, an analytical model that can be used for primary and secondary incident management planning that explicitly considers both the stochastic as well as the dynamic nature of traffic does not exist. In this paper, we present such a complementary model using a semi-Markov stochastic process approach. The model allows for unprecedented generality in the modeling of stochastics during incidents on freeways. Particularly, we relax the oftentimes restrictive Poisson assumption (in the modeling of vehicle arrivals, vehicle travel times, and incidence occurrence and recovery times) and explicitly model secondary incidents. Numerical case studies are provided to illustrate the proposed model.     

Distributions of queue lengths at fixed time traffic signals

This paper presents a new model which studies probability distributions of queue lengths at fixed time traffic signals. It extends Haight's model for Poisson arrivals that the arrival distribution during the effective red period is general and the headway between two successive departures is not less than the minimum departure headway. Moreover, the probability generating function of the queue length, at the end of the effective red period, is derived. The probabilities of the queue lengths, at the ends of the effective green, actual red and amber periods, are also obtained. Comparison is made with Haight's model. Finally a case study for the proposed model is reported.