Route swapping in dynamic traffic networks

Richard Mounce*, Malachy Carey

*Corresponding author for this work

Research output: Contribution to journalArticle

42 Citations (Scopus)

Abstract

A dynamic traffic assignment (DTA) model typically consists of a traffic performance model and a route choice model. The traffic performance model describes how traffic propagates (over time) along routes connecting origin-destination (OD) pairs, examples being the cell transmission model, the vertical queueing model and the travel time model. This is implemented in a dynamic network loading (DNL) algorithm, which uses the given route inflows to compute the link inflows (and hence link costs), which are then used to compute the route travel times (and hence route costs). A route swap process specifies the route inflows for tomorrow (at the next iteration) based on the route inflows today (at the current iteration). A dynamic user equilibrium (DUE), where each traveller on the network cannot reduce his or her cost of travel by switching to another route, can be sought by iterating between the DNL algorithm and the route swap process. The route swap process itself takes up very little computational time (although route set generation can be very computationally intensive for large networks). However, the choice of route swap process dramatically affects convergence and the speed of convergence. The paper details several route swap processes and considers whether they lead to a convergent system, assuming that the route cost vector is a monotone function of the route inflow vector.

Original languageEnglish
Pages (from-to)102-111
Number of pages10
JournalTransportation Research Part B: Methodological
Volume45
Issue number1
DOIs
Publication statusPublished - Jan 2011

Fingerprint

traffic
travel
Travel time
costs
Costs
Swaps
performance
time
Network dynamics

Keywords

  • convergence measure
  • dynamic traffic assignment
  • route swap process

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Transportation

Cite this

Route swapping in dynamic traffic networks. / Mounce, Richard; Carey, Malachy.

In: Transportation Research Part B: Methodological, Vol. 45, No. 1, 01.2011, p. 102-111.

Research output: Contribution to journalArticle

Mounce, Richard ; Carey, Malachy. / Route swapping in dynamic traffic networks. In: Transportation Research Part B: Methodological. 2011 ; Vol. 45, No. 1. pp. 102-111.
@article{70976a6ae358400f9668414dea23b2ae,
title = "Route swapping in dynamic traffic networks",
abstract = "A dynamic traffic assignment (DTA) model typically consists of a traffic performance model and a route choice model. The traffic performance model describes how traffic propagates (over time) along routes connecting origin-destination (OD) pairs, examples being the cell transmission model, the vertical queueing model and the travel time model. This is implemented in a dynamic network loading (DNL) algorithm, which uses the given route inflows to compute the link inflows (and hence link costs), which are then used to compute the route travel times (and hence route costs). A route swap process specifies the route inflows for tomorrow (at the next iteration) based on the route inflows today (at the current iteration). A dynamic user equilibrium (DUE), where each traveller on the network cannot reduce his or her cost of travel by switching to another route, can be sought by iterating between the DNL algorithm and the route swap process. The route swap process itself takes up very little computational time (although route set generation can be very computationally intensive for large networks). However, the choice of route swap process dramatically affects convergence and the speed of convergence. The paper details several route swap processes and considers whether they lead to a convergent system, assuming that the route cost vector is a monotone function of the route inflow vector.",
keywords = "convergence measure, dynamic traffic assignment, route swap process",
author = "Richard Mounce and Malachy Carey",
year = "2011",
month = "1",
doi = "10.1016/j.trb.2010.05.005",
language = "English",
volume = "45",
pages = "102--111",
journal = "Transportation Research Part B: Methodological",
issn = "0191-2615",
publisher = "Elsevier Limited",
number = "1",

}

TY - JOUR

T1 - Route swapping in dynamic traffic networks

AU - Mounce, Richard

AU - Carey, Malachy

PY - 2011/1

Y1 - 2011/1

N2 - A dynamic traffic assignment (DTA) model typically consists of a traffic performance model and a route choice model. The traffic performance model describes how traffic propagates (over time) along routes connecting origin-destination (OD) pairs, examples being the cell transmission model, the vertical queueing model and the travel time model. This is implemented in a dynamic network loading (DNL) algorithm, which uses the given route inflows to compute the link inflows (and hence link costs), which are then used to compute the route travel times (and hence route costs). A route swap process specifies the route inflows for tomorrow (at the next iteration) based on the route inflows today (at the current iteration). A dynamic user equilibrium (DUE), where each traveller on the network cannot reduce his or her cost of travel by switching to another route, can be sought by iterating between the DNL algorithm and the route swap process. The route swap process itself takes up very little computational time (although route set generation can be very computationally intensive for large networks). However, the choice of route swap process dramatically affects convergence and the speed of convergence. The paper details several route swap processes and considers whether they lead to a convergent system, assuming that the route cost vector is a monotone function of the route inflow vector.

AB - A dynamic traffic assignment (DTA) model typically consists of a traffic performance model and a route choice model. The traffic performance model describes how traffic propagates (over time) along routes connecting origin-destination (OD) pairs, examples being the cell transmission model, the vertical queueing model and the travel time model. This is implemented in a dynamic network loading (DNL) algorithm, which uses the given route inflows to compute the link inflows (and hence link costs), which are then used to compute the route travel times (and hence route costs). A route swap process specifies the route inflows for tomorrow (at the next iteration) based on the route inflows today (at the current iteration). A dynamic user equilibrium (DUE), where each traveller on the network cannot reduce his or her cost of travel by switching to another route, can be sought by iterating between the DNL algorithm and the route swap process. The route swap process itself takes up very little computational time (although route set generation can be very computationally intensive for large networks). However, the choice of route swap process dramatically affects convergence and the speed of convergence. The paper details several route swap processes and considers whether they lead to a convergent system, assuming that the route cost vector is a monotone function of the route inflow vector.

KW - convergence measure

KW - dynamic traffic assignment

KW - route swap process

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

U2 - 10.1016/j.trb.2010.05.005

DO - 10.1016/j.trb.2010.05.005

M3 - Article

AN - SCOPUS:78149499750

VL - 45

SP - 102

EP - 111

JO - Transportation Research Part B: Methodological

JF - Transportation Research Part B: Methodological

SN - 0191-2615

IS - 1

ER -