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

Abstract

Today’s air traffic management system is not expected to scale to the projected increase in traffic over the next two decades. Enhancing collaboration between the controllers and the users of the airspace could lessen the impact of the resulting air traffic flow problems. The authors summarize a new concept that has been proposed for collaborative air traffic flow management, the problems it is meant to address, and our approach to evaluating the concept. The authors present their initial simulation design and experimental results, using several simple route selection strategies and traffic flow management approaches. Though their model is still in an early stage of development, these results have revealed interesting properties of the proposed concept that will guide their continued development, refinement of the model, and possibly influence other studies of traffic management elsewhere. Finally, they conclude with the challenges of validating the proposed concept through simulation and future work. Document type: Part of book or chapter of book