A state‐of‐the‐art review of flow observability, estimation, and prediction problems in traffic
networks is performed. Since mathematical optimization provides a general framework for all …

Two requirements for a satisfactory dynamic network loading model are identified: a) an
allowance for overtaking on a link and b) flow propagation through the network should be …

This paper provides a review of the traffic performance models for dynamic traffic
assignment (DTA) and it identifies the strength and weakness of existing models …

An important class of models for macroscopic dynamic network loading (DNL) and dynamic
traffic assignment (DTA) is based on treating link travel times as a function of link occupancy …

Queue spillback is a common phenomenon in congested transportation networks.
Nevertheless, traditionally, dynamic traffic assignment (DTA) problems are developed with …

In this paper, after introducing a classification of dynamic network loading (DNL) procedures
(based on time, space, and demand discretization), many new methodologies recently …

Nous nous intéressons à la modélisation de l'affectation du trafic routier, c'est à dire, à la
façon dont les flux de véhicules se répartissent à l'intérieur d'un réseau de routes, en …

Travel time is the basic criterion used in most assignment modelling processes. However,
few examples of systematic in-depth investigation exist in the literature concerning the de …

In the past several years, in network models for dynamic traffic assignment, link travel times
have frequently been treated as a function of the number of vehicles on the link. In an earlier …

The travel time τ (t) on a link has often been treated in dynamic traffic assignment (DTA) as a
function of the number of vehicles x (t) on the link, that is, τ (t)= f (x (t)). In earlier papers …