Route estimation based on network flow maximization

10 pages•Published: 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:	https://easychair.org/publications/paper/r6Q6
	https://doi.org/10.29007/rjj7

BibTeX entry

@inproceedings{SUMO2018:Route_estimation_based_network,
  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ßner and Leonhard Lücken and Robert Hilbrich and Yun-Pang Flötteröd and Jakob Erdmann and Laura Bieker-Walz and Michael Behrisch},
  series    = {EPiC Series in Engineering},
  volume    = {2},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2516-2330},
  url       = {/publications/paper/r6Q6},
  doi       = {10.29007/rjj7},
  pages     = {173-182},
  year      = {2018}}

Download PDF Open PDF in browser