Convergence in a continuous dynamic queueing model for traffic networks

Richard Mounce

Research output: Contribution to journalArticle

53 Citations (Scopus)

Abstract

The paper considers a dynamic traffic assignment model with deterministic queueing and inelastic demand for each origin-destination (OD) pair in the network. Two types of time-varying behaviour are modelled. First, within-day time is regarded as a continuous variable. During each day, flows propagating through routes connecting OD pairs are represented by non-negative, essentially bounded and measurable functions. Also, day-to-day time is (slightly surprisingly) modelled as if it were continuous. The day-to-day dynamical system that is adopted is derived naturally from the usual user equilibrium condition. The route cost is shown to be a Lipschitz continuous function of route flow in the single bottleneck per route case. Global convergence to equilibrium is shown to be guaranteed when the route cost vector is a non-decreasing (monotone) function of the route flow vector. In the single bottleneck per route case, the route cost function is shown to be a monotone function of the route flow if the bottleneck capacities are all non-decreasing as functions of within-day time. Monotonicity of the route cost function is also shown to hold when each bottleneck has at most one route passing through it.

Original languageEnglish
Pages (from-to)779-791
Number of pages13
JournalTransportation Research Part B: Methodological
Volume40
Issue number9
Early online date10 Jan 2006
DOIs
Publication statusPublished - 1 Nov 2006

Fingerprint

traffic
Cost functions
costs
Costs
Dynamical systems
Queueing model
time
demand
Cost function
Destination
Time-varying
Queueing
Assignment model
Global convergence
Monotonicity
Dynamic traffic assignment

Keywords

  • Bottleneck
  • Dynamic traffic assignment
  • Monotonicity
  • Queueing

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Transportation

Cite this

Convergence in a continuous dynamic queueing model for traffic networks. / Mounce, Richard.

In: Transportation Research Part B: Methodological, Vol. 40, No. 9, 01.11.2006, p. 779-791.

Research output: Contribution to journalArticle

@article{05f06999a2be4ecda9b8addfa2bede6d,
title = "Convergence in a continuous dynamic queueing model for traffic networks",
abstract = "The paper considers a dynamic traffic assignment model with deterministic queueing and inelastic demand for each origin-destination (OD) pair in the network. Two types of time-varying behaviour are modelled. First, within-day time is regarded as a continuous variable. During each day, flows propagating through routes connecting OD pairs are represented by non-negative, essentially bounded and measurable functions. Also, day-to-day time is (slightly surprisingly) modelled as if it were continuous. The day-to-day dynamical system that is adopted is derived naturally from the usual user equilibrium condition. The route cost is shown to be a Lipschitz continuous function of route flow in the single bottleneck per route case. Global convergence to equilibrium is shown to be guaranteed when the route cost vector is a non-decreasing (monotone) function of the route flow vector. In the single bottleneck per route case, the route cost function is shown to be a monotone function of the route flow if the bottleneck capacities are all non-decreasing as functions of within-day time. Monotonicity of the route cost function is also shown to hold when each bottleneck has at most one route passing through it.",
keywords = "Bottleneck, Dynamic traffic assignment, Monotonicity, Queueing",
author = "Richard Mounce",
year = "2006",
month = "11",
day = "1",
doi = "10.1016/j.trb.2005.10.004",
language = "English",
volume = "40",
pages = "779--791",
journal = "Transportation Research Part B: Methodological",
issn = "0191-2615",
publisher = "Elsevier Limited",
number = "9",

}

TY - JOUR

T1 - Convergence in a continuous dynamic queueing model for traffic networks

AU - Mounce, Richard

PY - 2006/11/1

Y1 - 2006/11/1

N2 - The paper considers a dynamic traffic assignment model with deterministic queueing and inelastic demand for each origin-destination (OD) pair in the network. Two types of time-varying behaviour are modelled. First, within-day time is regarded as a continuous variable. During each day, flows propagating through routes connecting OD pairs are represented by non-negative, essentially bounded and measurable functions. Also, day-to-day time is (slightly surprisingly) modelled as if it were continuous. The day-to-day dynamical system that is adopted is derived naturally from the usual user equilibrium condition. The route cost is shown to be a Lipschitz continuous function of route flow in the single bottleneck per route case. Global convergence to equilibrium is shown to be guaranteed when the route cost vector is a non-decreasing (monotone) function of the route flow vector. In the single bottleneck per route case, the route cost function is shown to be a monotone function of the route flow if the bottleneck capacities are all non-decreasing as functions of within-day time. Monotonicity of the route cost function is also shown to hold when each bottleneck has at most one route passing through it.

AB - The paper considers a dynamic traffic assignment model with deterministic queueing and inelastic demand for each origin-destination (OD) pair in the network. Two types of time-varying behaviour are modelled. First, within-day time is regarded as a continuous variable. During each day, flows propagating through routes connecting OD pairs are represented by non-negative, essentially bounded and measurable functions. Also, day-to-day time is (slightly surprisingly) modelled as if it were continuous. The day-to-day dynamical system that is adopted is derived naturally from the usual user equilibrium condition. The route cost is shown to be a Lipschitz continuous function of route flow in the single bottleneck per route case. Global convergence to equilibrium is shown to be guaranteed when the route cost vector is a non-decreasing (monotone) function of the route flow vector. In the single bottleneck per route case, the route cost function is shown to be a monotone function of the route flow if the bottleneck capacities are all non-decreasing as functions of within-day time. Monotonicity of the route cost function is also shown to hold when each bottleneck has at most one route passing through it.

KW - Bottleneck

KW - Dynamic traffic assignment

KW - Monotonicity

KW - Queueing

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

U2 - 10.1016/j.trb.2005.10.004

DO - 10.1016/j.trb.2005.10.004

M3 - Article

VL - 40

SP - 779

EP - 791

JO - Transportation Research Part B: Methodological

JF - Transportation Research Part B: Methodological

SN - 0191-2615

IS - 9

ER -