Traffic assignment: A survey of mathematical models and techniques

Pushkin Kachroo, Kaan Ozbay

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

This chapter presents the fundamentals of the theory and techniques of traffic assignment problem. It first presents the steady-state traffic assignment problem formulation which is also called static assignment, followed by Dynamic Traffic Assignment (DTA), where the traffic demand on the network is time varying. The static assignment problem is shown in a mathematical programming setting for two different objectives to be satisfied. The first one where all users experience same travel times in alternate used routes is called user-equilibrium and another setting called system optimum in which the assignment attempts to minimize the total travel time. The alternate formulation uses variational inequality method which is also presented. Dynamic travel routing problem is also reviewed in the variational inequality setting. DTA problem is shown in discrete and continuous time in terms of lumped parameters as well as in a macroscopic setting, where partial differential equations are used for the link traffic dynamics. A Hamilton–Jacobi- based travel time dynamics model is also presented for the links and routes, which is integrated with the macroscopic traffic dynamics. Simulation-based DTA method is also very briefly reviewed. This chapter is taken from the following Springer publication and is reproduced here, with permission and with minor changes: Pushkin Kachroo, and Neveen Shlayan, “Dynamic traffic assignment: A survey of mathematical models and technique,” Advances in Dynamic Network Modeling in Complex Transportation Systems (Editor: Satish V. Ukkusuri and Kaan Özbay) Springer New York, 2013. 1-25.

Original languageEnglish (US)
Title of host publicationAdvances in Industrial Control
PublisherSpringer International Publishing
Pages25-53
Number of pages29
Edition9783319692296
DOIs
StatePublished - Jan 1 2018

Publication series

NameAdvances in Industrial Control
Number9783319692296
ISSN (Print)1430-9491
ISSN (Electronic)2193-1577

Fingerprint

Mathematical models
Travel time
Time varying networks
Mathematical programming
Partial differential equations
Dynamic models

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Automotive Engineering
  • Aerospace Engineering
  • Industrial and Manufacturing Engineering

Cite this

Kachroo, P., & Ozbay, K. (2018). Traffic assignment: A survey of mathematical models and techniques. In Advances in Industrial Control (9783319692296 ed., pp. 25-53). (Advances in Industrial Control; No. 9783319692296). Springer International Publishing. https://doi.org/10.1007/978-3-319-69231-9_2

Traffic assignment : A survey of mathematical models and techniques. / Kachroo, Pushkin; Ozbay, Kaan.

Advances in Industrial Control. 9783319692296. ed. Springer International Publishing, 2018. p. 25-53 (Advances in Industrial Control; No. 9783319692296).

Research output: Chapter in Book/Report/Conference proceedingChapter

Kachroo, P & Ozbay, K 2018, Traffic assignment: A survey of mathematical models and techniques. in Advances in Industrial Control. 9783319692296 edn, Advances in Industrial Control, no. 9783319692296, Springer International Publishing, pp. 25-53. https://doi.org/10.1007/978-3-319-69231-9_2
Kachroo P, Ozbay K. Traffic assignment: A survey of mathematical models and techniques. In Advances in Industrial Control. 9783319692296 ed. Springer International Publishing. 2018. p. 25-53. (Advances in Industrial Control; 9783319692296). https://doi.org/10.1007/978-3-319-69231-9_2
Kachroo, Pushkin ; Ozbay, Kaan. / Traffic assignment : A survey of mathematical models and techniques. Advances in Industrial Control. 9783319692296. ed. Springer International Publishing, 2018. pp. 25-53 (Advances in Industrial Control; 9783319692296).
@inbook{07fea793e190431cb33f242f51980d05,
title = "Traffic assignment: A survey of mathematical models and techniques",
abstract = "This chapter presents the fundamentals of the theory and techniques of traffic assignment problem. It first presents the steady-state traffic assignment problem formulation which is also called static assignment, followed by Dynamic Traffic Assignment (DTA), where the traffic demand on the network is time varying. The static assignment problem is shown in a mathematical programming setting for two different objectives to be satisfied. The first one where all users experience same travel times in alternate used routes is called user-equilibrium and another setting called system optimum in which the assignment attempts to minimize the total travel time. The alternate formulation uses variational inequality method which is also presented. Dynamic travel routing problem is also reviewed in the variational inequality setting. DTA problem is shown in discrete and continuous time in terms of lumped parameters as well as in a macroscopic setting, where partial differential equations are used for the link traffic dynamics. A Hamilton–Jacobi- based travel time dynamics model is also presented for the links and routes, which is integrated with the macroscopic traffic dynamics. Simulation-based DTA method is also very briefly reviewed. This chapter is taken from the following Springer publication and is reproduced here, with permission and with minor changes: Pushkin Kachroo, and Neveen Shlayan, “Dynamic traffic assignment: A survey of mathematical models and technique,” Advances in Dynamic Network Modeling in Complex Transportation Systems (Editor: Satish V. Ukkusuri and Kaan {\"O}zbay) Springer New York, 2013. 1-25.",
author = "Pushkin Kachroo and Kaan Ozbay",
year = "2018",
month = "1",
day = "1",
doi = "10.1007/978-3-319-69231-9_2",
language = "English (US)",
series = "Advances in Industrial Control",
publisher = "Springer International Publishing",
number = "9783319692296",
pages = "25--53",
booktitle = "Advances in Industrial Control",
edition = "9783319692296",

}

TY - CHAP

T1 - Traffic assignment

T2 - A survey of mathematical models and techniques

AU - Kachroo, Pushkin

AU - Ozbay, Kaan

PY - 2018/1/1

Y1 - 2018/1/1

N2 - This chapter presents the fundamentals of the theory and techniques of traffic assignment problem. It first presents the steady-state traffic assignment problem formulation which is also called static assignment, followed by Dynamic Traffic Assignment (DTA), where the traffic demand on the network is time varying. The static assignment problem is shown in a mathematical programming setting for two different objectives to be satisfied. The first one where all users experience same travel times in alternate used routes is called user-equilibrium and another setting called system optimum in which the assignment attempts to minimize the total travel time. The alternate formulation uses variational inequality method which is also presented. Dynamic travel routing problem is also reviewed in the variational inequality setting. DTA problem is shown in discrete and continuous time in terms of lumped parameters as well as in a macroscopic setting, where partial differential equations are used for the link traffic dynamics. A Hamilton–Jacobi- based travel time dynamics model is also presented for the links and routes, which is integrated with the macroscopic traffic dynamics. Simulation-based DTA method is also very briefly reviewed. This chapter is taken from the following Springer publication and is reproduced here, with permission and with minor changes: Pushkin Kachroo, and Neveen Shlayan, “Dynamic traffic assignment: A survey of mathematical models and technique,” Advances in Dynamic Network Modeling in Complex Transportation Systems (Editor: Satish V. Ukkusuri and Kaan Özbay) Springer New York, 2013. 1-25.

AB - This chapter presents the fundamentals of the theory and techniques of traffic assignment problem. It first presents the steady-state traffic assignment problem formulation which is also called static assignment, followed by Dynamic Traffic Assignment (DTA), where the traffic demand on the network is time varying. The static assignment problem is shown in a mathematical programming setting for two different objectives to be satisfied. The first one where all users experience same travel times in alternate used routes is called user-equilibrium and another setting called system optimum in which the assignment attempts to minimize the total travel time. The alternate formulation uses variational inequality method which is also presented. Dynamic travel routing problem is also reviewed in the variational inequality setting. DTA problem is shown in discrete and continuous time in terms of lumped parameters as well as in a macroscopic setting, where partial differential equations are used for the link traffic dynamics. A Hamilton–Jacobi- based travel time dynamics model is also presented for the links and routes, which is integrated with the macroscopic traffic dynamics. Simulation-based DTA method is also very briefly reviewed. This chapter is taken from the following Springer publication and is reproduced here, with permission and with minor changes: Pushkin Kachroo, and Neveen Shlayan, “Dynamic traffic assignment: A survey of mathematical models and technique,” Advances in Dynamic Network Modeling in Complex Transportation Systems (Editor: Satish V. Ukkusuri and Kaan Özbay) Springer New York, 2013. 1-25.

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

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

U2 - 10.1007/978-3-319-69231-9_2

DO - 10.1007/978-3-319-69231-9_2

M3 - Chapter

AN - SCOPUS:85047219067

T3 - Advances in Industrial Control

SP - 25

EP - 53

BT - Advances in Industrial Control

PB - Springer International Publishing

ER -