DOI: 10.29007/rjj7
|View full text |Cite
|
Sign up to set email alerts
|

Route estimation based on network flow maximization

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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
1
0
1

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 5 publications
0
1
0
1
Order By: Relevance
“…In our approach, we use the tool "flowrouter.py" [8] with partially reasonable results for our case study in Kyoto.…”
Section: Calibration Of the Simulation Network Based On Aggregated In...mentioning
confidence: 99%
“…In our approach, we use the tool "flowrouter.py" [8] with partially reasonable results for our case study in Kyoto.…”
Section: Calibration Of the Simulation Network Based On Aggregated In...mentioning
confidence: 99%
“…A avaliação de desempenho da solução proposta foi efetuada por meio de simulações usando como simulador de rede a ferramenta OMNeT++ 4.6 [Varga 2003] e como simulador de mobilidade a ferramenta SUMO 0.25.0 [Behrisch et al 2011], ambos por meio do framework de redes veiculares Veins [Sommer et al 2011]. Os resultados foram comparados com protocolos da literatura AID, CARRO e UV-CAST, apresentados na Seção 2.…”
Section: Avaliação De Desempenhounclassified