Abstract

International audience This paper develops a graph-theoretic framework for large scale bi-dimensional transport networks and provides new insight into the dynamic traffic assignment. Reactive dynamic assignment are deployed to handle the traffic contingencies, traffic uncertainties and traffic congestion. New shortest paths problem in large networks is defined and routes cost calculation is provided. Since mathematical modelling of traffic flow is a keystone in the theory of traffic flow management, and then in the traffic assignment, it is convenient to elaborate a good model of assignment for large scale networks relying on an appropriate model of flow related to very large networks. That is the zone-based optimization of traffic flow model on networks developed by [8], completed and improved by [9].

Document type: Part of book or chapter of book

Full document

The PDF file did not load properly or your web browser does not support viewing PDF files. Download directly to your device: Download PDF document

Original document

The different versions of the original document can be found in:

Back to Top

Document information

Published on 01/01/2016

Volume 2016, 2016
DOI: 10.1007/978-3-319-48944-5_17
Licence: CC BY-NC-SA license

Document Score

0

Views 0
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?