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.
Route estimation based on network flow maximization
2018 ; Berlin
2018-05-01
Aufsatz (Konferenz)
Elektronische Ressource
Deutsch
Route Flow Entropy Maximization in Origin-Based Traffic Assignment
British Library Conference Proceedings | 1999
|Regret Minimization and Utility Maximization Mixed Route Choice Model
British Library Conference Proceedings | 2020
|Regret Minimization and Utility Maximization Mixed Route Choice Model
Springer Verlag | 2020
|