(Created page with " == Abstract == International audience This paper develops a graph-theoretic framework for large scale bi-dimensional transport networks and provides new insight into the dy...") |
|||
| Line 2: | Line 2: | ||
== Abstract == | == Abstract == | ||
| − | International audience | + | 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]. |
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| Line 16: | Line 11: | ||
* [https://hal.archives-ouvertes.fr/hal-01583783/file/Reactive%20assignment%20-%20ICSS_2016.pdf https://hal.archives-ouvertes.fr/hal-01583783/file/Reactive%20assignment%20-%20ICSS_2016.pdf] | * [https://hal.archives-ouvertes.fr/hal-01583783/file/Reactive%20assignment%20-%20ICSS_2016.pdf https://hal.archives-ouvertes.fr/hal-01583783/file/Reactive%20assignment%20-%20ICSS_2016.pdf] | ||
| − | * [http://link.springer.com/content/pdf/10.1007/978-3-319-48944-5_17 http://link.springer.com/content/pdf/10.1007/978-3-319-48944-5_17],[http://dx.doi.org/10.1007/978-3-319-48944-5_17 http://dx.doi.org/10.1007/978-3-319-48944-5_17] under the license http://www.springer.com/tdm | + | * [http://link.springer.com/content/pdf/10.1007/978-3-319-48944-5_17 http://link.springer.com/content/pdf/10.1007/978-3-319-48944-5_17], |
| + | : [http://dx.doi.org/10.1007/978-3-319-48944-5_17 http://dx.doi.org/10.1007/978-3-319-48944-5_17] under the license http://www.springer.com/tdm | ||
| − | * [https://hal.archives-ouvertes.fr/hal-01583783 https://hal.archives-ouvertes.fr/hal-01583783],[https://hal.archives-ouvertes.fr/hal-01583783/document https://hal.archives-ouvertes.fr/hal-01583783/document],[https://hal.archives-ouvertes.fr/hal-01583783/file/Reactive%20assignment%20-%20ICSS_2016.pdf https://hal.archives-ouvertes.fr/hal-01583783/file/Reactive%20assignment%20-%20ICSS_2016.pdf] | + | * [https://hal.archives-ouvertes.fr/hal-01583783 https://hal.archives-ouvertes.fr/hal-01583783], |
| + | : [https://hal.archives-ouvertes.fr/hal-01583783/document https://hal.archives-ouvertes.fr/hal-01583783/document], | ||
| + | : [https://hal.archives-ouvertes.fr/hal-01583783/file/Reactive%20assignment%20-%20ICSS_2016.pdf https://hal.archives-ouvertes.fr/hal-01583783/file/Reactive%20assignment%20-%20ICSS_2016.pdf] | ||
| − | * [https://link.springer.com/chapter/10.1007/978-3-319-48944-5_17 https://link.springer.com/chapter/10.1007/978-3-319-48944-5_17],[https://hal.archives-ouvertes.fr/hal-01583783 https://hal.archives-ouvertes.fr/hal-01583783],[https://academic.microsoft.com/#/detail/2548542948 https://academic.microsoft.com/#/detail/2548542948] | + | * [https://hal.archives-ouvertes.fr/hal-01583783 https://hal.archives-ouvertes.fr/hal-01583783], |
| + | : [https://link.springer.com/chapter/10.1007/978-3-319-48944-5_17 https://link.springer.com/chapter/10.1007/978-3-319-48944-5_17], | ||
| + | : [https://hal.archives-ouvertes.fr/hal-01583783/document https://hal.archives-ouvertes.fr/hal-01583783/document], | ||
| + | : [https://academic.microsoft.com/#/detail/2548542948 https://academic.microsoft.com/#/detail/2548542948] | ||
Latest revision as of 16:42, 21 January 2021
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].
Original document
The different versions of the original document can be found in:
- http://dx.doi.org/10.1007/978-3-319-48944-5_17 under the license http://www.springer.com/tdm
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
Share this document
Keywords
Computer science • Control engineering • Cost calculation • Distributed computing • Flow (psychology) • Large networks • Traffic congestion • Traffic flow • Traffic flow management • [ MATH.MATH-AP ] Mathematics [math]/Analysis of PDEs [math.AP] • [ MATH.MATH-DS ] Mathematics [math]/Dynamical Systems [math.DS] • [ MATH.MATH-NA ] Mathematics [math]/Numerical Analysis [math.NA] • [ MATH.MATH-ST ] Mathematics [math]/Statistics [math.ST]
claim authorship
Are you one of the authors of this document?