Networks of fixed-cycle intersections

Research output: Contribution to journalArticleAcademic

52 Downloads (Pure)

Abstract

We present an algorithmic method for analyzing networks of intersections with static signaling, with as primary example a line network that allows traffic flow over several intersections in one main direction. The method decomposes the network into separate intersections and treats each intersection in isolation using an extension of the fixed-cycle traffic-light (FCTL) queue. The network effects are modeled by matching the output process of one intersection with the input process of the next (downstream) intersection. This network analysis provides insight into wave phenomena due to vehicles experiencing progressive cascades of green lights and sheds light on platoon forming in case of imperfections. Our algorithm is shown to match results from extensive discrete-event simulations and can also be applied to more complex network structures.
Original languageEnglish
Number of pages24
JournalarXiv
VolumeARXIV 1611.02947v1
Publication statusPublished - 9 Nov 2016

Fingerprint

Discrete event simulation
Complex networks
Electric network analysis
Telecommunication traffic
Defects

Keywords

  • math.PR

Cite this

@article{d115310f13c74a07a46f0f44a4480e0f,
title = "Networks of fixed-cycle intersections",
abstract = "We present an algorithmic method for analyzing networks of intersections with static signaling, with as primary example a line network that allows traffic flow over several intersections in one main direction. The method decomposes the network into separate intersections and treats each intersection in isolation using an extension of the fixed-cycle traffic-light (FCTL) queue. The network effects are modeled by matching the output process of one intersection with the input process of the next (downstream) intersection. This network analysis provides insight into wave phenomena due to vehicles experiencing progressive cascades of green lights and sheds light on platoon forming in case of imperfections. Our algorithm is shown to match results from extensive discrete-event simulations and can also be applied to more complex network structures.",
keywords = "math.PR",
author = "M. Boon and {van Leeuwaarden}, J.",
year = "2016",
month = "11",
day = "9",
language = "English",
volume = "ARXIV 1611.02947v1",
journal = "arXiv",
publisher = "Cornell University Library",

}

Networks of fixed-cycle intersections. / Boon, M.; van Leeuwaarden, J.

In: arXiv, Vol. ARXIV 1611.02947v1, 09.11.2016.

Research output: Contribution to journalArticleAcademic

TY - JOUR

T1 - Networks of fixed-cycle intersections

AU - Boon, M.

AU - van Leeuwaarden, J.

PY - 2016/11/9

Y1 - 2016/11/9

N2 - We present an algorithmic method for analyzing networks of intersections with static signaling, with as primary example a line network that allows traffic flow over several intersections in one main direction. The method decomposes the network into separate intersections and treats each intersection in isolation using an extension of the fixed-cycle traffic-light (FCTL) queue. The network effects are modeled by matching the output process of one intersection with the input process of the next (downstream) intersection. This network analysis provides insight into wave phenomena due to vehicles experiencing progressive cascades of green lights and sheds light on platoon forming in case of imperfections. Our algorithm is shown to match results from extensive discrete-event simulations and can also be applied to more complex network structures.

AB - We present an algorithmic method for analyzing networks of intersections with static signaling, with as primary example a line network that allows traffic flow over several intersections in one main direction. The method decomposes the network into separate intersections and treats each intersection in isolation using an extension of the fixed-cycle traffic-light (FCTL) queue. The network effects are modeled by matching the output process of one intersection with the input process of the next (downstream) intersection. This network analysis provides insight into wave phenomena due to vehicles experiencing progressive cascades of green lights and sheds light on platoon forming in case of imperfections. Our algorithm is shown to match results from extensive discrete-event simulations and can also be applied to more complex network structures.

KW - math.PR

M3 - Article

VL - ARXIV 1611.02947v1

JO - arXiv

JF - arXiv

ER -