Private road competition and equilibrium with traffic equilibrium constraints

Toll road competition is one of the important issues under a build-operate-transfer (BOT) scheme, which is being encountered nowadays in many cities. When there are two or more competing firms and each firm operates a competitive toll road, their profits are interrelated due to the competitors' choices and demand inter-dependence in the network. In this paper we develop game-theoretic approaches to the study of the road network, on which multiple toll roads are operated by competitive private firms. The strategic interactions and market equilibria among the private firms are analyzed both in determining their supply (road capacity) and price (toll level) over the network. The toll road competition problems in general traffic equilibrium networks are formulated as an equilibrium program with equilibrium constraints or bi-level variational inequalities. Heuristic solution methods are proposed and their convergences are demonstrated with simple network examples. It is shown that private pricing and competition can be both profitable and welfare-improving.     

Some developments in equilibrium traffic assignment

A network optimization problem is formulated which yields a probabilistic equilibrated traffic assignment incorporating congestion effects and which as a special case, reduces to a user optimized equilibrium solution. In the resulting model, path choice is determined by a logit formula in which path costs are functions of the assigned flows. The article also demonstrates the similarity between some fixed demand incremental methods of traffic assignment and the minimization problem associated with computing the user equilibrium assignment.     

On some traffic equilibrium theory paradoxes

We consider the asymmetric equilibrium problem with fixed demands in a transportation network where the travel cost on each link may depend on the flow on this as well as other links of the network and we study how the travellers' cost is affected by changes in the travel demand or addition of new routes. Assuming that the travel cost functions are strongly monotone, we derive formulas which express, under certain conditions, how a change in travel demand associated with a particular origin-destination (O / D) pair will affect the travelers' cost for any O / D pair. We then use these formulas to show that an increase in the travel demand associated with a particular O / D pair (all other remaining fixed) always results in an increase in the travelers' cost on that O / D pair, however, the travelers' cost on other O / D pairs may decrease. We then derive formulas yielding, under certain conditions, the change in travelers' cost on every O / D pair induced by the addition of a new path. These can be used to determine, whether Braess' paradox occurs in the network. We then show that when a new path is added, the travelers' cost associated with the particular O / D pair joined by this path will decrease (hence Braess' paradox does not occur) if a test matrix is positive semidefinite.     

Comparative tests of multimodal traffic equilibrium methods

In this study we proceeded to test the relative efficiencies of the two main computational techniques now available for calculating the traffic equilibrium in multimodal networks, namely, the relaxation and projection methods. Since both of these methods solve at each step a mathematical programming problem, we first set out to test the Frank-Wolfe algorithm and the Dafermos-Sparrow algorithm and found the latter to be the more efficient algorithm. As expected, this was also the case when these algorithms were used to solve the mathematical programming problem at each step of the relaxation method. We then investigated how different versions of the projection method enhance its performance. Subsequently, we proceeded to our main goal to compare the best projection method with the relaxation method. We tested multimodal networks with three different classes of monotone travel cost functions and found that the form of the travel cost functions affects the performance of the two basic techniques available for computing the multimodal equilibrium.     

Lane‐based optimization of traffic equilibrium settings for area traffic control

Area traffic control is an important element in Intelligent Transportation System (ITS). This paper extends the lane‐based optimization method to a traffic equilibrium network, which improves the operational performance of signal‐controlled network. We formulate a decomposition approach to simultaneously optimize the lane markings and signal settings for a signal‐controlled network that comprises two levels of optimization. At the junction level, the lane markings, control sequence, and other aspects of the signal settings are optimized for individual junctions, whereas at the network level, the group‐based signal settings are optimized to take into account the re‐routing characteristics of travelers and signal coordination effects that are based on a TRANSYT traffic model, which is a well‐known procedure for evaluating the performance of signal‐controlled networks. We use a numerical example to demonstrate the effectiveness of the proposed methodology.     

An alternative model in traffic flow equations

The kinetic theory for traffic flow equations can be approached using the Grad’s method. This method, which is derived from the kinetic gas theory, was developed for the Paveri-Fontana equation when a special desired velocity model is assumed. A closure relation for the set of macroscopic equations is found when the density, the average velocity and the velocity variance are the relevant variables chosen to describe the system. Simulation results are also shown and a qualitative comparison with other models in the literature is presented.     

An iterative group-based signal optimization scheme for traffic equilibrium networks

This paper presents an iterative scheme for a combined signal optimization and assignment problem, using a traffic model from the well-known procedure TRANSYT. The signal settings are optimized by means of a group-based technique, in which the signal timings are specified by the common cycle time, the start time and duration of the period of right of way for each signal group in the network. The optimization problem was formulated as an integer program and solved by a set of heuristics. Given the optimized signal settings determined from the group-based technique, a path-based assignment algorithm is employed to obtain the equilibrium traffic pattern using the sensitivity information for TRANSYT model and a Frank-Wolf method. Based on the equilibrium flow pattern, the group-based optimization algorithm is then used to determine a better set of signal timings. The procedure is repeated until certain convergence criteria are satisfied. A numerical example is employed to demonstrate the benefits obtained from this iterative scheme. Encouraging results are obtained.     

Modeling stochastic perception error in the mean-excess traffic equilibrium model

In this paper, we extend the α-reliable mean-excess traffic equilibrium (METE) model of Chen and Zhou (Transportation Research Part B 44(4), 2010, 493-513) by explicitly modeling the stochastic perception errors within the travelers’ route choice decision processes. In the METE model, each traveler not only considers a travel time budget for ensuring on-time arrival at a confidence level α, but also accounts for the impact of encountering worse travel times in the (1 − α) quantile of the distribution tail. Furthermore, due to the imperfect knowledge of the travel time variability particularly in congested networks without advanced traveler information systems, the travelers’ route choice decisions are based on the perceived travel time distribution rather than the actual travel time distribution. In order to compute the perceived mean-excess travel time, an approximation method based on moment analysis is developed. It involves using the conditional moment generation function to derive the perceived link travel time, the Cornish-Fisher Asymptotic Expansion to estimate the perceived travel time budget, and the Acerbi and Tasche Approximation to estimate the perceived mean-excess travel time. The proposed stochastic mean-excess traffic equilibrium (SMETE) model is formulated as a variational inequality (VI) problem, and solved by a route-based solution algorithm with the use of the modified alternating direction method. Numerical examples are also provided to illustrate the application of the proposed SMETE model and solution method.     

An equilibrium algorithm for the spatial aggregation problem of traffic assignment

Present traffic assignment methods require that all possible origins and destinations of trips taking place within a study area be represented as if they were taking place to and from a small set of points or centroids. Each centroid is supposed to represent the location of all trip-ends within a given zone, and this necessarily misrepresents points located at the edges of the zone.In order to alleviate this problem (which we refer to as the spatial aggregation problem) one could use smaller zones and more centroids, but existing traffic assignment algorithms cannot efficiently handle many centroids.This paper introduces an algorithm procedure which is designed to handle a substantially larger number of centroids. In the paper that follows, the technique is further developed to take into account a continuous distribution of population.     

Properties of a traffic control policy which ensure the existence of a traffic equilibrium consistent with the policy

We consider a network with interactions and capacity constraints at each junction. We give conditions on the interactions and constraints which, if satisfied at each separate junction, ensure that any feasible assignment problem has an equilibrium solution. Two illustrative examples are provided; the first arises naturally and does not satisfy our conditions, while the second does satisfy our conditions but is somewhat unnatural.     

General stochastic user equilibrium traffic assignment problem with link capacity constraints

This paper addresses a general stochastic user equilibrium (SUE) traffic assignment problem with link capacity constraints. It first proposes a novel linearly constrained minimization model in terms of path flows and then shows that any of its local minimums satisfies the generalized SUE conditions. As the objective function of the proposed model involves path‐specific delay functions without explicit mathematical expressions, its Lagrangian dual formulation is analyzed. On the basis of the Lagrangian dual model, a convergent Lagrangian dual method with a predetermined step size sequence is developed. This solution method merely invokes a subroutine at each iteration to perform a conventional SUE traffic assignment excluding link capacity constraints. Finally, two numerical examples are used to illustrate the proposed model and solution method.     

The impact of speed limits on traffic equilibrium and system performance in networks

Speed limits are usually imposed on roads in an attempt to enhance safety and sometimes serve the purpose of reducing fuel consumption and vehicular emissions as well. Most previous studies up to date focus on investigation of the effects of speed limits from a local perspective, while network-wide traffic reallocation effects are overlooked. This paper makes the first attempt to investigate how a link-specific speed limit law reallocates traffic flow in an equilibrium manner at a macroscopic network level. We find that, although the link travel time–flow relationship is altered after a speed limit is imposed, the standard traffic assignment method still applies. With the commonly adopted assumptions, the uniqueness of link travel times at user equilibrium (UE) remains valid, and the UE flows on links with non-binding speed limits are still unique. The UE flows on other links with binding speed limits may not be unique but can be explicitly characterized by a polyhedron or a linear system of equalities and inequalities. Furthermore, taking into account the traffic reallocation effects of speed limits, we compare the capability of speed limits and road pricing for decentralizing desirable network flow patterns. Although from a different perspective for regulating traffic flows with a different mechanism, a speed limit law may play the same role as a toll charge scheme and perform better than some negative (rebate) toll schemes under certain conditions for network flow management.     

Welfare effects of road pricing and traffic information under alternative ownership regimes

This paper models strategic interactions between a road supplier, a provider of traffic information, and road users, with stochastic travel times. Using a game-theoretical analysis of suppliers’ pricing strategies, we assess the social welfare effects of traffic information under various ownership regimes. The results show that the distortive welfare effect of monopolistic information pricing appears relatively small. Collusion of the road operator and information provider yields higher social welfare than independent pricing by two firms. The intuition behind this result resembles that behind the welfare effects of double marginalization, but is not exactly the same, as traffic information is not strictly complementary to road use.     

An alternative formulation of the simultaneous route and departure-time choice equilibrium problem

Traditional (static) network equilibrium models have always been formulated in a route-based fashion rather than a vehicle-based fashion. That is, the decision variables have been the number of vehicles using each route rather than the route choices of each vehicle. Given the success of this approach, it is not surprising that recent “dynamic” network equilibrium models have been formulated in a similar way. That is, the decision variables in these models are usually the route-specific departure rates over time. In this paper, we develop a vehicle-based equilibrium model of simultaneous route and departure-time choice and discuss the possible advantages of this approach. We then describe a heuristic for solving this model and demonstrate its effectiveness on several small examples.     

Joint optimization of freight facility location and pavement infrastructure rehabilitation under network traffic equilibrium

Establishment of industry facilities often induces heavy vehicle traffic that exacerbates congestion and pavement deterioration in the neighboring highway network. While planning facility locations and land use developments, it is important to take into account the routing of freight vehicles, the impact on public traffic, as well as the planning of pavement rehabilitation. This paper presents an integrated facility location model that simultaneously considers traffic routing under congestion and pavement rehabilitation under deterioration. The objective is to minimize the total cost due to facility investment, transportation cost including traffic delay, and pavement life-cycle costs. Building upon analytical results on optimal pavement rehabilitation, the problem is formulated into a bi-level mixed-integer non-linear program (MINLP), with facility location, freight shipment routing and pavement rehabilitation decisions in the upper level and traffic equilibrium in the lower level. This problem is then reformulated into an equivalent single-level MINLP based on Karush–Kuhn–Tucker (KKT) conditions and approximation by piece-wise linear functions. Numerical experiments on hypothetical and empirical network examples are conducted to show performance of the proposed algorithm and to draw managerial insights.     

The existence of an equilibrium solution to the traffic assignment problem when there are junction interactions

We consider a network with interactions and capacity constraints at each junction. We give conditions on the interactions and constraints which, if satisfied at each separate junction, ensure that any feasible assignment problem has an equilibrium solution. Two illustrative examples are provided; the first arises naturally and does not satisfy our conditions, while the second does satisfy our conditions but is somewhat unnatural.     

Dynamic user equilibrium with side constraints for a traffic network: Theoretical development and numerical solution algorithm

This paper investigates a traffic volume control scheme for a dynamic traffic network model which aims to ensure that traffic volumes on specified links do not exceed preferred levels. The problem is formulated as a dynamic user equilibrium problem with side constraints (DUE-SC) in which the side constraints represent the restrictions on the traffic volumes. Travelers choose their departure times and routes to minimize their generalized travel costs, which include early/late arrival penalties. An infinite-dimensional variational inequality (VI) is formulated to model the DUE-SC. Based on this VI formulation, we establish an existence result for the DUE-SC by showing that the VI admits at least one solution. To analyze the necessary condition for the DUE-SC, we restate the VI as an equivalent optimal control problem. The Lagrange multipliers associated with the side constraints as derived from the optimality condition of the DUE-SC provide the traffic volume control scheme. The control scheme can be interpreted as additional travel delays (either tolls or access delays) imposed upon drivers for using the controlled links. This additional delay term derived from the Lagrange multiplier is compared with its counterpart in a static user equilibrium assignment model. If the side constraint is chosen as the storage capacity of a link, the additional delay can be viewed as the effort needed to prevent the link from spillback. Under this circumstance, it is found that the flow is incompressible when the link traffic volume is equal to its storage capacity. An algorithm based on Euler’s discretization scheme and nonlinear programming is proposed to solve the DUE-SC. Numerical examples are presented to illustrate the mechanism of the proposed traffic volume control scheme.     

A splitting rate model of traffic re-routeing and traffic control

The paper presents an idealised dynamical model of day-to-day or within-day re-routeing using splitting rates at nodes, or node-exit flows, rather than route-flows. It is shown that under certain conditions the dynamical model gives rise to a sequence of link flow vectors which converges to a set of approximate Wardrop equilibria. A special dynamical signal green-time re-allocation model is added; the combination is also shown (in outline) to converge to the set of approximate consistent equilibria under certain conditions. Finally the paper uses model network results to illustrate a method of designing fixed time signal timings to meet different scenarios.     

Applications of wavelet transform for analysis of freeway traffic: Bottlenecks, transient traffic, and traffic oscillations

This paper demonstrates the capabilities of wavelet transform (WT) for analyzing important features related to bottleneck activations and traffic oscillations in congested traffic in a systematic manner. In particular, the analysis of loop detector data from a freeway shows that the use of wavelet-based energy can effectively identify the location of an active bottleneck, the arrival time of the resulting queue at each upstream sensor location, and the start and end of a transition during the onset of a queue. Vehicle trajectories were also analyzed using WT and our analysis shows that the wavelet-based energies of individual vehicles can effectively detect the origins of deceleration waves and shed light on possible triggers (e.g., lane-changing). The spatiotemporal propagations of oscillations identified by tracing wavelet-based energy peaks from vehicle to vehicle enable analysis of oscillation amplitude, duration and intensity.