Traffic assignment and signal control in saturated road networks

doi:10.1016/0965-8564(94)E0007-V

Transportation Research Part A: Policy and Practice

Volume 29, Issue 2, March 1995, Pages 125-139

https://doi.org/10.1016/0965-8564(94)E0007-V Get rights and content

Abstract

This article presents a model and a procedure for determining traffic assignment and optimizing signal timings in saturated road networks. Both queuing and congestion are explicitly taken into account in predicting equilibrium flows and setting signal split parameters for a fixed pattern of origin-to-destination trip demand. The model is formulated as a bilevel programming problem. The lower-level problem represents a network equilibrium model involving queuing explicitly on saturated links, which predicts how drivers will react to any given signal control pattern. The upper-level problem is to determine signal splits to optimize a system objective function, taking account of drivers' route choice behavior in response to signal split changes. Sensitivity analysis is implemented for the queuing network equilibrium problem to obtain the derivatives of equilibrium link flows and equilibrium queuing delays with respect to signal splits. The derivative information is then used to develop a gradient descent algorithm to solve the proposed bilevel traffic signal control problem. A numerical example is included to demonstrate the potential application of the assignment model and signal optimization procedure.

References (28)

G.E. Cantarella et al.
Iterative procedure for equilibrium network traffic signal setting
Transpn. Res.
(1991)
T.J. Dickson
A note on traffic assignment and signal timings in signal controlled road network
Transpn. Res.
(1981)
C.S. Fisk
Game theory and transportation systems modeling
Transpn. Res.
(1984)
N.H. Gartner et al.
Pilot study of computer-based urban traffic management
Transpn. Res.
(1980)
L.J. LeBlanc et al.
An efficient approach to solving the road network equilibrium traffic assignment problem
Transpn. Res.
(1975)
S.C. Van As
Overflow delay in signalized networks
Transpn. Res.
(1991)
S. Yagar
Minimizing delays for transient demands with application to signalized road junctions
Transpn. Res.
(1977)
R.E. Allsop
Some possibilities for using traffic control to influence trip destinations and route choice
T.L. Friesz et al.
Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints
Mathemat. Program.
(1990)
B.G. Heydecker et al.
The equilibrium network design problem

V.F. Hurdle

Signalized intersection delay model — a primer for the uninitiated

Transpn. Res. Rec.

(1985)

H. Inouye

Equilibrium traffic assignment on a network with congested flows

Infrastructure Planning Rev.

(1986)

H. Inouye

Traffic equilibrium in congested networks and their numerical solution

P. Marcott

Network optimization with continuous control parameters

Transpn. Sci.

(1983)

Cited by (274)

Backpressure or no backpressure? Two simple examples
2024, Transportation Research Part C: Emerging Technologies
Many responsive traffic signal control strategies are “pressure-driven”. These strategies move green-time from stages with a lower pressure to stages with a higher pressure, at each junction; often aiming to approximately equalise stage pressures at each junction. In some of these pressure-driven strategies each stage pressure at a junction includes a “backpressure” term, which depends on downstream links. Such backpressure terms reduce the pressure on stages and reduce pressure most for those stages leading toward the most highly congested downstream road links. The expectation is that there will then be a reduction in traffic flow exiting the junction toward already highly congested road links, and that this will reduce queue lengths and network delays. This paper shows that this is not always the case by giving two examples where having backpressure within the control policy on a network with two signal controlled junctions
(1) increases both equilibrium delays at one of the junctions for certain demands, and
(2) never reduces any of the equilibrium delays at either junction.
A simple dynamic evolution with a steady reduction in demand is also shown in which two of the considered policies, one with backpressure, give rise to equilibrium delays and queues which tend to infinity, and reveal a gap; in this gap feasible demands have no equilibrium consistent with the two control policies and in a day-to-day dynamical context delays and queues are unbounded. This paper considers only the simple network shown in figure 1 under certain specified conditions. One main avenue for further research might be to consider whether the results shown here also hold in different networks under different conditions.
An efficient hyperpath-based algorithm for the capacitated transit equilibrium assignment problem
2024, Transportmetrica A: Transport Science
This paper studied the capacitated transit equilibrium assignment problem (CTEAP), which particularly accounts for the capacity effect that impacts passengers' route choices in a transit network. Specifically, we impose strict capacity constraints on line segments to ensure that the passenger flow does not exceed the line capacity. By introducing associated Lagrange multipliers, we derived the generalised hyperpath cost function and established an equivalent variational inequality formulation. A solution framework is developed to solve CTEAP based on the Method of Multipliers. To handle destroyed Cartesian product structures, we transformed the master problem into a sequence of uncapacitated subproblems, which can be tackled by two modified Newton-type hyperpath-based algorithms. Numerical analyses were performed for a small Gentile network and a large Shenzhen transit network to evaluate the impacts of the capacity constraint on passenger flows and computation costs. Our results demonstrate the superiority of the proposed CTEAP model to prevent over-loaded flows, and show the promise of applying the hyperpath-based algorithm in the implementation of real-world networks.
Pre-trip reservation enabled route guidance and signal control cooperative method for improving network throughput
2023, Physica A: Statistical Mechanics and its Applications
With the ever-increasing traffic demand, efficient urban traffic operation is facing more and more pressure and challenges. Route guidance and signal control are effective methods to enhance the existing urban traffic capacity and realize the sustainable development of traffic systems. In this paper, a collaborative optimization method of route guidance and intersection signal controlling is proposed under the background of a pre-trip reservation. Vehicles were divided into reserved and non-reserved vehicles, which corresponds to pre-trip reservation and non-reserved travel, respectively. Firstly, route guidance models considering both road network efficiency and vehicle travel time are proposed for different types of vehicles. Then, based on the impact of different travel modes on traffic flow distribution, a collaborative optimization for route guidance and intersection signal control was realized through the proposed dynamic signal optimization method. The experimental results showed that road network capacity was improved by 16% under the condition of high traffic flow by using the proposed optimization method. The proposed method can also alleviate the congestion of some sections without causing the transfer of congestion. The effectiveness of the proposed method was verified by simulation experiments, which can provide a theoretical reference for traffic control and management in the context of pre-trip reservation.
A three-stage algorithm for coordinate controlling of multi-intersection signal
2023, Expert Systems with Applications
In the traffic networks, the traffic plans for one intersection are coordinated with those of the adjacent intersections. At the same time, it should be considered that inflow vehicles do not originate at adjacent intersections and that outflow vehicles are the connection links of two adjacent intersections. In this study, first, the inflow vehicles entering the connection link between two adjacent intersections are considered. The outflow vehicles departing the connection links between two adjacent intersections in the traffic network are also considered. Second, a bilevel programming model is introduced. The upper level is designed to optimize the carbon dioxide emissions of the vehicles at intersections and the lower level is designed to match the optimal phases of each inflow lane. To solve the model, a three-stage algorithm, which can obtain the optimization value for the model, is proposed. In the algorithm, the difference between the inflow vehicles and the outflow vehicles estimated by an iter equation. Last, certain methods are employed to compare the proposed model with the algorithm. The results of the numerical experiments indicate that the model and algorithm are effective and that the optimization model and the three-state algorithm could be more reasonable for the plans of multi-intersections than the state-of-the-arts methods.
A Dantzig-Wolfe decomposition-based algorithm for capacitated passenger assignment problem with time-varying demand in high-speed railway networks
2022, Transportation Research Part C: Emerging Technologies
This paper proposes an algorithm for solving the schedule-based passenger assignment problem, with explicit consideration of continuous time-varying demand and tight capacity constraints for large-scale high-speed railway (HSR) networks. We construct the space–time travel network and formulate the assignment model by destination-based arc flow variables, then design a Dantzig-Wolfe (D-W) decomposition-based algorithm to solve the large-scale model of this problem with less memory requirement and computational complexity. The sub-problem in each iteration can be solved as a single-source (destination) minimum cost flow problem without capacity constraint by the “rooftops” method, which provides an effective technique to tackle both continuous and discrete time-varying demand in the assignment problem. It is further demonstrated that the assignment solutions for discrete time-varying demand can converge to that for continuous time-varying demand with the increase of demand discretization number. Three real case studies with different HSR network scales show that the proposed algorithm is efficient in memory and computational complexity, especially when highly accurate solutions for passenger assignment on large-scale HSR networks are needed.
The capacity constraint physarum solver
2022, Journal of Computational Science
Physarum polycephalum inspired algorithm (PPA) has attracted immense attention recently. By modeling real-world problems into a graph and adopting proper adaption equation, PPA could solve system optimization or user equilibrium problems. However, few PPA-based algorithms can tackle problems with capacity constraints, lacking the ability to control link flows in the PPA. To tackle this problem, a novel framework, the capacitated PPA (CPPA), is proposed to allow capacity constraints toward link flow in the PPA. To demonstrate the validity of the CPPA, we have developed three applications of the CPPA, i.e., the CPPA for the maximum-flow problem (CPPA-MF), the CPPA for the minimum-cost–maximum-flow problem (CPPA-MCMF), and the CPPA for the link-capacitated traffic assignment problem (CPPA-CTAP). In the experiments, the CPPA-MF shows competitive performance among four baseline algorithms; the CPPA-MCMF is approximately 50% faster than the baseline algorithms; the CPPA-CTAP reduce the oversaturated degree from approximately 40% to 1.5% compared to the original algorithm. The experimental results prove the validation of the CPPA framework. The CPPA is also robust since it have been successfully applied in three different scenarios. The proposed CPPA extends the PPA’s application to capacity-constrain problems and might shed some lights on its future applications in complex real-world problems.

View all citing articles on Scopus

View full text

Traffic assignment and signal control in saturated road networks

Abstract

Transpn. Res.

Transpn. Res.

Transpn. Res.

Transpn. Res.

Transpn. Res.

Transpn. Res.

Transpn. Res.

Some possibilities for using traffic control to influence trip destinations and route choice

Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints

Mathemat. Program.

The equilibrium network design problem

Signalized intersection delay model — a primer for the uninitiated

Transpn. Res. Rec.

Equilibrium traffic assignment on a network with congested flows

Infrastructure Planning Rev.

Traffic equilibrium in congested networks and their numerical solution

Network optimization with continuous control parameters

Transpn. Sci.