Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

Convex formulations of dynamic network traffic assignment for control of freeway networks

Como, Giacomo LU ; Lovisari, Enrico LU and Savla, Ketan (2016) 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015 p.755-762
Abstract

We study System Optimum Dynamic Traffic Assignment (SO-DTA) for realistic traffic dynamics controlled by variable speed limits, ramp metering, and routing controls. We consider continuous-time cell-based Dynamic Network Loading models that include as special cases the Cell Transmission Model (CTM) with FIFO rule at the diverge junctions as well as non-FIFO diverge rules. While a straightforward consideration of traffic dynamics and control variables in the SO-DTA is known to lead to a non-convex program, and hence is computationally expensive for real-time applications, we consider SO-DTA formulations in which the total inflow into and the total outflow from the cells are independently constrained to be upper bounded by concave supply... (More)

We study System Optimum Dynamic Traffic Assignment (SO-DTA) for realistic traffic dynamics controlled by variable speed limits, ramp metering, and routing controls. We consider continuous-time cell-based Dynamic Network Loading models that include as special cases the Cell Transmission Model (CTM) with FIFO rule at the diverge junctions as well as non-FIFO diverge rules. While a straightforward consideration of traffic dynamics and control variables in the SO-DTA is known to lead to a non-convex program, and hence is computationally expensive for real-time applications, we consider SO-DTA formulations in which the total inflow into and the total outflow from the cells are independently constrained to be upper bounded by concave supply and demand functions, respectively, thus preserving convexity. We then design open-loop controllers that guarantee that the optimal solutions under the relaxed constraints are feasible with respect to realistic traffic dynamics. We develop this methodology for three variations of the SO-DTA problem that impose constraints on turning ratios to varying degrees.

(Less)
Please use this url to cite or link to this publication:
author
; and
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
host publication
2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015
article number
7447082
pages
8 pages
publisher
IEEE - Institute of Electrical and Electronics Engineers Inc.
conference name
53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015
conference location
Monticello, United States
conference dates
2015-09-29 - 2015-10-02
external identifiers
  • scopus:84969752744
ISBN
9781509018239
DOI
10.1109/ALLERTON.2015.7447082
language
English
LU publication?
yes
id
f3ac519f-c64f-42ea-9efe-f654586b0f44
date added to LUP
2016-08-25 19:05:17
date last changed
2024-01-04 11:29:52
@inproceedings{f3ac519f-c64f-42ea-9efe-f654586b0f44,
  abstract     = {{<p>We study System Optimum Dynamic Traffic Assignment (SO-DTA) for realistic traffic dynamics controlled by variable speed limits, ramp metering, and routing controls. We consider continuous-time cell-based Dynamic Network Loading models that include as special cases the Cell Transmission Model (CTM) with FIFO rule at the diverge junctions as well as non-FIFO diverge rules. While a straightforward consideration of traffic dynamics and control variables in the SO-DTA is known to lead to a non-convex program, and hence is computationally expensive for real-time applications, we consider SO-DTA formulations in which the total inflow into and the total outflow from the cells are independently constrained to be upper bounded by concave supply and demand functions, respectively, thus preserving convexity. We then design open-loop controllers that guarantee that the optimal solutions under the relaxed constraints are feasible with respect to realistic traffic dynamics. We develop this methodology for three variations of the SO-DTA problem that impose constraints on turning ratios to varying degrees.</p>}},
  author       = {{Como, Giacomo and Lovisari, Enrico and Savla, Ketan}},
  booktitle    = {{2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015}},
  isbn         = {{9781509018239}},
  language     = {{eng}},
  month        = {{04}},
  pages        = {{755--762}},
  publisher    = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
  title        = {{Convex formulations of dynamic network traffic assignment for control of freeway networks}},
  url          = {{http://dx.doi.org/10.1109/ALLERTON.2015.7447082}},
  doi          = {{10.1109/ALLERTON.2015.7447082}},
  year         = {{2016}},
}