A polymorphic dynamic network loading (PDNL) model is developed and discretized to integrate a variety of macroscopic traffic flow and node models. The polymorphism, realized through a general node-link interface and proper discretization, offers several prominent advantages. First of all, PDNL allows road facilities in the same network to be represented by different traffic flow models based o...

Existing frequency assignment efforts in wireless sensor network research focus on balancing available physical frequencies among neighboring nodes, without paying attention to the fact that different nodes have different traffic volumes. Ignoring the different traffic requirements in different nodes in frequency assignment design leads to poor MAC performance. Therefore, in this paper, we are ...

Simulation-based Dynamic Traffic Assignment models have important applications in real-time traffic management and control. The efficacy of these systems rests on the ability to generate accurate estimates predictions states, which necessitates online calibration. A widely used solution approach for calibration is Extended Kalman Filter (EKF), -- although appealing its flexibility incorporate a...

This paper studies the dynamic user optimal (DUO) traffic assignment problem considering simultaneous route and departure time choice. The DUO problem is formulated as a discrete variational inequality (DVI), with an embeded LWR-consistent mesoscopic dynamic network loading (DNL) model to encapsulate traffic dynamics. The presented DNL model is capable of capturing realistic traffic phenomena s...

(ABSTRACT) Traffic congestion has been cited as the most conspicuous problem in traffic management. It has far-reaching economic, social and political effects. Intelligent Transportation Systems (ITS) research and development programs have been assigned the task of developing sophisticated techniques and counter-measures to reduce traffic congestion to manageable levels, and also achieve these ...

In this paper we present a study of the performance of a general class of channel assignment algorithms. These algorithms, which we call R-algorithms, are completely characterized by the set of carried-traffic “states” which they allow. We shall see that for any such algorithm, there is a closed-form expression for the carried t r a c function, which lends itself to several kinds of asymptotic ...