Traffic Control and Route Choice; Capacity Maximization and Stability

Michael J. Smith*, Ronghui Liu, Richard Mounce

*Corresponding author for this work

Research output: Contribution to journalArticle

4 Citations (Scopus)
4 Downloads (Pure)

Abstract

This paper presents idealised natural general and special dynamical models of day-to-day re-routeing and of day to day green-time response. Both green-time response models are based on the responsive control policy P0 introduced in Smith (1979a, b, c 1987). Several results are proved. For example, it is shown that, for any steady feasible demand within a flow model, if the general day to day re-routeing model is combined with the general day to day green-time response model then under natural conditions any (flow, green-time) solution trajectory cannot leave the region of supply-feasible (flow, green-time) pairs and costs are bounded. Throughput is maximised in the following sense. Given any constant feasible demand; this demand is met as any routeing / green-time trajectory evolves (following either the general or the special dynamical model). The paper then considers simple "pressure driven" responsive control policies, with explicit signal cycles of fixed positive duration. A possible approach to dynamic traffic control allowing for variable route choices is outlined. It is finally shown that modified Varaiya (2013) and Le at al (2013) pressure-driven responsive controls may not maximise network capacity, by considering a very simple one junction network. It is shown that (with each of these two modified policies) there is a steady demand within the capacity of the network for which there is no Wardrop equilibrium consistent with the policy. In contrast, responsive P0 on this simple network does maximise throughput at a quasi-dynamic user equilibrium consistent with P0; queues and delays remain bounded in natural dynamical evolutions in this case. It is to be expected that this P0 result may be extended to allow for certain time-varying demands on a much wider variety of networks; to show that this is indeed the case is a challenge for the future.

Original languageEnglish
Pages (from-to)556-577
Number of pages22
JournalTransportation Research Procedia
Volume7
Early online date22 Jul 2015
DOIs
Publication statusPublished - 2015
Event21st International Symposium on Transportation and Traffic Theory - Kobe, Japan
Duration: 5 Aug 20157 Aug 2015

Fingerprint

Traffic control
traffic control
demand
Trajectories
Throughput
time
supply
costs
Costs

Keywords

  • control and route-choice
  • convergence
  • day to day
  • signal control
  • stability

ASJC Scopus subject areas

  • Transportation

Cite this

Traffic Control and Route Choice; Capacity Maximization and Stability. / Smith, Michael J.; Liu, Ronghui; Mounce, Richard.

In: Transportation Research Procedia, Vol. 7, 2015, p. 556-577.

Research output: Contribution to journalArticle

Smith, Michael J. ; Liu, Ronghui ; Mounce, Richard. / Traffic Control and Route Choice; Capacity Maximization and Stability. In: Transportation Research Procedia. 2015 ; Vol. 7. pp. 556-577.
@article{f47745cc4f30496e9735f04b29b5254a,
title = "Traffic Control and Route Choice; Capacity Maximization and Stability",
abstract = "This paper presents idealised natural general and special dynamical models of day-to-day re-routeing and of day to day green-time response. Both green-time response models are based on the responsive control policy P0 introduced in Smith (1979a, b, c 1987). Several results are proved. For example, it is shown that, for any steady feasible demand within a flow model, if the general day to day re-routeing model is combined with the general day to day green-time response model then under natural conditions any (flow, green-time) solution trajectory cannot leave the region of supply-feasible (flow, green-time) pairs and costs are bounded. Throughput is maximised in the following sense. Given any constant feasible demand; this demand is met as any routeing / green-time trajectory evolves (following either the general or the special dynamical model). The paper then considers simple {"}pressure driven{"} responsive control policies, with explicit signal cycles of fixed positive duration. A possible approach to dynamic traffic control allowing for variable route choices is outlined. It is finally shown that modified Varaiya (2013) and Le at al (2013) pressure-driven responsive controls may not maximise network capacity, by considering a very simple one junction network. It is shown that (with each of these two modified policies) there is a steady demand within the capacity of the network for which there is no Wardrop equilibrium consistent with the policy. In contrast, responsive P0 on this simple network does maximise throughput at a quasi-dynamic user equilibrium consistent with P0; queues and delays remain bounded in natural dynamical evolutions in this case. It is to be expected that this P0 result may be extended to allow for certain time-varying demands on a much wider variety of networks; to show that this is indeed the case is a challenge for the future.",
keywords = "control and route-choice, convergence, day to day, signal control, stability",
author = "Smith, {Michael J.} and Ronghui Liu and Richard Mounce",
year = "2015",
doi = "10.1016/j.trpro.2015.06.029",
language = "English",
volume = "7",
pages = "556--577",
journal = "Transportation Research Procedia",
issn = "2352-1465",
publisher = "Elsevier BV",

}

TY - JOUR

T1 - Traffic Control and Route Choice; Capacity Maximization and Stability

AU - Smith, Michael J.

AU - Liu, Ronghui

AU - Mounce, Richard

PY - 2015

Y1 - 2015

N2 - This paper presents idealised natural general and special dynamical models of day-to-day re-routeing and of day to day green-time response. Both green-time response models are based on the responsive control policy P0 introduced in Smith (1979a, b, c 1987). Several results are proved. For example, it is shown that, for any steady feasible demand within a flow model, if the general day to day re-routeing model is combined with the general day to day green-time response model then under natural conditions any (flow, green-time) solution trajectory cannot leave the region of supply-feasible (flow, green-time) pairs and costs are bounded. Throughput is maximised in the following sense. Given any constant feasible demand; this demand is met as any routeing / green-time trajectory evolves (following either the general or the special dynamical model). The paper then considers simple "pressure driven" responsive control policies, with explicit signal cycles of fixed positive duration. A possible approach to dynamic traffic control allowing for variable route choices is outlined. It is finally shown that modified Varaiya (2013) and Le at al (2013) pressure-driven responsive controls may not maximise network capacity, by considering a very simple one junction network. It is shown that (with each of these two modified policies) there is a steady demand within the capacity of the network for which there is no Wardrop equilibrium consistent with the policy. In contrast, responsive P0 on this simple network does maximise throughput at a quasi-dynamic user equilibrium consistent with P0; queues and delays remain bounded in natural dynamical evolutions in this case. It is to be expected that this P0 result may be extended to allow for certain time-varying demands on a much wider variety of networks; to show that this is indeed the case is a challenge for the future.

AB - This paper presents idealised natural general and special dynamical models of day-to-day re-routeing and of day to day green-time response. Both green-time response models are based on the responsive control policy P0 introduced in Smith (1979a, b, c 1987). Several results are proved. For example, it is shown that, for any steady feasible demand within a flow model, if the general day to day re-routeing model is combined with the general day to day green-time response model then under natural conditions any (flow, green-time) solution trajectory cannot leave the region of supply-feasible (flow, green-time) pairs and costs are bounded. Throughput is maximised in the following sense. Given any constant feasible demand; this demand is met as any routeing / green-time trajectory evolves (following either the general or the special dynamical model). The paper then considers simple "pressure driven" responsive control policies, with explicit signal cycles of fixed positive duration. A possible approach to dynamic traffic control allowing for variable route choices is outlined. It is finally shown that modified Varaiya (2013) and Le at al (2013) pressure-driven responsive controls may not maximise network capacity, by considering a very simple one junction network. It is shown that (with each of these two modified policies) there is a steady demand within the capacity of the network for which there is no Wardrop equilibrium consistent with the policy. In contrast, responsive P0 on this simple network does maximise throughput at a quasi-dynamic user equilibrium consistent with P0; queues and delays remain bounded in natural dynamical evolutions in this case. It is to be expected that this P0 result may be extended to allow for certain time-varying demands on a much wider variety of networks; to show that this is indeed the case is a challenge for the future.

KW - control and route-choice

KW - convergence

KW - day to day

KW - signal control

KW - stability

UR - http://www.scopus.com/inward/record.url?scp=84959368563&partnerID=8YFLogxK

U2 - 10.1016/j.trpro.2015.06.029

DO - 10.1016/j.trpro.2015.06.029

M3 - Article

VL - 7

SP - 556

EP - 577

JO - Transportation Research Procedia

JF - Transportation Research Procedia

SN - 2352-1465

ER -