Download PDFOpen PDF in browser

Route estimation based on network flow maximization

10 pagesPublished: June 25, 2018

Abstract

We present an algorithm which calculates a list of routes in a street network, approximating the flows given on the streets by traffic counts. We prove optimality with respect to maximizing the flows treating the counts as constraints and show that the algorithm can cope very well with missing data using a real motorway example.

Keyphrases: network flow, Route estimation, Routing

In: Evamarie Wießner, Leonhard Lücken, Robert Hilbrich, Yun-Pang Flötteröd, Jakob Erdmann, Laura Bieker-Walz and Michael Behrisch (editors). SUMO 2018- Simulating Autonomous and Intermodal Transport Systems, vol 2, pages 173--182

Links:
BibTeX entry
@inproceedings{SUMO2018:Route_estimation_based_on,
  author    = {Michael Behrisch and Jakob Erdmann},
  title     = {Route estimation based on network flow maximization},
  booktitle = {SUMO 2018- Simulating Autonomous and Intermodal Transport Systems},
  editor    = {Evamarie Wie\{\textbackslash{}ss\}ner and Leonhard L\textbackslash{}"ucken and Robert Hilbrich and Yun-Pang Fl\textbackslash{}"otter\textbackslash{}"od and Jakob Erdmann and Laura Bieker-Walz and Michael Behrisch},
  series    = {EPiC Series in Engineering},
  volume    = {2},
  pages     = {173--182},
  year      = {2018},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2516-2330},
  url       = {https://easychair.org/publications/paper/r6Q6},
  doi       = {10.29007/rjj7}}
Download PDFOpen PDF in browser