Increasing the capacity of signalized intersections with separate left turn phases

A separate turn phase is often used on the approach leg to an intersections with heavy left turns. This wastes capacity on the approach because some of its lanes cannot discharge during its green phases. The paper shows that the problem can be eliminated by reorganizing traffic on all the lanes upstream of an intersection using a mid-block pre-signal. If drivers behave deterministically, the capacity that can be achieved is the same as if there were no left turns. However, if the reorganization is too drastic, it may be counterintuitive to drivers. This can be remedied by reorganizing traffic on just some of the available lanes. It is shown that such partial reorganization still increases capacity significantly, even if drivers behave randomly and only one lane is reorganized. The paper shows how to optimize the design of a pre-signal system for a generic intersection. It also identifies both, the potential benefits of the proposed system for a broad class of intersections, and the domain of application where the benefits are most significant.     

Equilibria of bilateral taxi–customer searching and meeting on networks

This paper proposes an equilibrium model to characterize the bilateral searching and meeting between customers and taxis on road networks. A taxi driver searches or waits for a customer by considering both the expected searching or waiting time cost and ride revenue, and a customer seeks a taxi ride to minimize full trip price. We suppose that the bilateral taxi–customer searching and meeting occurs anywhere in residential and commercial zones or at prescribed taxi stands, such as an airport or a railway station. We propose a meeting function to spell out the search and meeting frictions that arise endogenously as a result of the distinct spatial feature of the area and the taxi–customer moving decisions. With the proposed meeting function and the assumptions underlying taxi–customer search behaviors, the stationary competitive equilibrium achieved at fixed fare prices is determined when the demand of the customers matches the supply of taxis or there is market clearing at the prevailing searching and waiting times in every meeting location. We establish the existence of such an equilibrium by virtue of Brouwer’s fixed-point theorem and demonstrate its principal operational characteristics with a numerical example.     

Total cost analysis: An alternative to benefit-cost analysis in evaluating transportation alternatives

This paper explains the theory in support of total cost analysis (TCA) to compare transportation system alternatives. The full costs of each alternative are first aggregated, including travel time costs and monetizable environmental and social costs. Many costs which are considered on the benefits side of the equation in benefit-cost analysis (BCA) as "cost savings" are brought over to the costs side. Total cost differences among alternatives are then traded off against their estimated non-monetized benefits or impacts, just as a consumer trades off product quality against cost before deciding which product he or she will buy. One advantage of TCA over traditional BCA is that the concept of "total cost" is more easily understood by the public and by political decision-makers than BCA concepts such as "net present worth", "benefit-cost ratio" and "internal rate of return". A second advantage is that there is no suggestion that all "benefits" have been considered; decision-makers are free to use their own value judgements to trade off total cost against non-monetizable social, environmental and economic impacts, just as they trade off quality and convenience against cost when purchasing goods and services in their roles as consumers. The TCA approach is demonstrated in this paper through a case study of two systemwide alternatives for the Baltimore, MD urban area.     

A frequency-based maritime container assignment model

This paper transfers the classic frequency-based transit assignment method of Spiess and Florian to containers demonstrating its promise as the basis for a global maritime container assignment model. In this model, containers are carried by shipping lines operating strings (or port rotations) with given service frequencies. An origin–destination matrix of full containers is assigned to these strings to minimize sailing time plus container dwell time at the origin port and any intermediate transhipment ports. This necessitated two significant model extensions. The first involves the repositioning of empty containers so that a net outflow of full containers from any port is balanced by a net inflow of empty containers, and vice versa. As with full containers, empty containers are repositioned to minimize the sum of sailing and dwell time, with a facility to discount the dwell time of empty containers in recognition of the absence of inventory. The second involves the inclusion of an upper limit to the maximum number of container moves per unit time at any port. The dual variable for this constraint provides a shadow price, or surcharge, for loading or unloading a container at a congested port. Insight into the interpretation of the dual variables is given by proposition and proof. Model behaviour is illustrated by a simple numerical example. The paper concludes by considering the next steps toward realising a container assignment model that can, amongst other things, support the assessment of supply chain vulnerability to maritime disruptions.     

The cost saving potential of carsharing in a US context

Carsharing is a vehicle sharing service for those with occasional need of private transportation. Transportation planners are beginning to see great potential for carsharing in helping to create a more diversified and sustainable transport system. While it has grown quickly in the US in recent years, it is still far from the level where it can deliver significant aggregate benefits. A key element to the potential growth of carsharing is its ability to provide cost savings to those who adopt it in favor of vehicle ownership. This research seeks to quantify these potential cost savings. The costs of carsharing and vehicle ownership are compared based on actual vehicle usage patterns from a large survey of San Francisco Bay Area residents. The results of this analysis show that a significant minority of Bay Area households own a vehicle with a usage pattern that carsharing could accommodate at a lower cost. Further research is required to indentify how these cost savings translate to the adoption of carsharing.     

Sensitivity analysis on stochastic equilibrium transportation networks using genetic algorithm

This study deals with the sensitivity analysis of an equilibrium transportation networks using genetic algorithm approach and uses the bi‐level iterative sensitivity algorithm. Therefore, integrated Genetic Algorithm‐TRANSYT and Path Flow Estimator (GATPFE) is developed for signalized road networks for various level of perceived travel time in order to test the sensitivity of perceived travel time error in an urban stochastic road networks. Level of information provided to drivers correspondingly affects the signal timing parameters and hence the Stochastic User Equilibrium (SUE) link flows. When the information on road system is increased, the road users try to avoid conflicting links. Therefore, the stochastic equilibrium assignment concept tends to be user equilibrium. The GATPFE is used to solve the bi‐level problem, where the Area Traffic Control (ATC) is the upper‐level and the SUE assignment is the lower‐level. The GATPFE is tested for six‐junction network taken from literature. The results show that the integrated GATPFE can be applied to carry out sensitivity analysis at the equilibrium network design problems for various level of information and it simultaneously optimize the signal timings (i.e. network common cycle time, signal stage and offsets between junctions).     

A link-node complementarity model and solution algorithm for dynamic user equilibria with exact flow propagations

In this paper, we propose a link-node complementarity model for the basic deterministic dynamic user equilibrium (DUE) problem with single-user-class and fixed demands. The model complements link-path formulations that have been widely studied for dynamic user equilibria. Under various dynamic network constraints, especially the exact flow propagation constraints, we show that the continuous-time dynamic user equilibrium problem can be formulated as an infinite dimensional mixed complementarity model. The continuous-time model can be further discretized as a finite dimensional non-linear complementarity problem (NCP). The proposed discrete-time model captures the exact flow propagation constraints that were usually approximated in previous studies. By associating link inflow at the beginning of a time interval to travel times at the end of the interval, the resulting discrete-time model is predictive rather than reactive. The solution existence and compactness condition for the proposed model is established under mild assumptions. The model is solved by an iterative algorithm with a relaxed NCP solved at each iteration. Numerical examples are provided to illustrate the proposed model and solution approach. We particularly show why predictive DUE is preferable to reactive DUE from an algorithmic perspective.     

Credible commitment and congestion pricing

Transportation analysts frequently assert that congestion pricing’s political obstacles can be overcome through astute use of the toll revenue pricing generates. Such “revenue recycling,” however, implies that the collectors of the toll revenue will not be its final recipients, meaning that any revenue recipient must believe that the revenue collector will honor promises to deliver the money. This raises the potential for credible commitment problems. Promises to spend revenue can solve one political problem, because revenue is an easy benefit to understand, but create another one, because revenue is easy to divert. Revenue recycling may therefore not be a promising way to build political support for congestion pricing. We highlight the role commitment problems have played efforts to implement congestion pricing, using examples from around the world and then focusing on California. Because congestion reduction is a more certain benefit than any particular use of the toll revenue, demonstration projects, rather than revenue promises, will be key to pricing’s political success.     

Remoteness and accessibility in the vulnerability analysis of regional road networks

This paper considers the development of a method for network vulnerability analysis which considers the socio-economic impacts of network degradation and seeks to determine the most critical locations in the network. The method compares the levels of remoteness (or its inverse, accessibility) of localities within the study region, on the basis of the impacts of degradation of the road network on a recognised accessibility/remoteness index that can be applied to each and every location within the region. It thus extends the earlier work on accessibility-based vulnerability analysis which was limited to assessment of impacts on selected nodes in a network. The new method allows study of impacts on both specified locations (which do not have to be represented as network nodes) and the region as a whole. The accessibility/remoteness index is defined so that an accessibility surface can be calculated for the region, and the volume under this surface provides an overall measure of accessibility. Changes in the volume under different network states thus reflect the overall impacts. The method is applied to a rural region in south east Australia.     

The simple platoon advancement model of its technologies applied to vehicle control at signalised intersections

The Simple Platoon Advancement (SPA) Model describes a conceptual system whose principal objective is to increase the throughput of vehicles at signalised intersections. This is achieved through a novel combination of Intelligent Transport System (ITS) technologies including Automatic Cruise Control, Lane Departure Avoidance, and Collision Avoidance. These are combined in SPA so that vehicles are progressed through signalised intersections under automated control. All of the vehicles in a stationary queue are moved instantly at the start‐of‐green as a closely‐spaced platoon. Dispersion occurs after all vehicles are in motion. Throughput of the SPA model is determined analytically and comparisons are made between the SPA model and a valid representation of current road traffic behaviour. These comparisons show that theoretically a SPA system can progress nearly twice as many vehicles past the stopline as can be seen in today's road network. Other benefits of a conceptual SPA system are improved safety and a reduction in delay per vehicle.