This article describes a new and novel approach to model dynamic simulation of mobile traffic agents such as pedestrians and cars on a simple network graph. The modeling approach is based on route choice self-organization of multi agents. In contrast to the traditional method of traffic assignment that assigns probability on each route based on a generalized travel cost, our model considers rou...

The ability of simulation-based dynamic traffic assignment (SBDTA) models to produce reliable solutions is crucial for practical applications, particularly for those involving the comparison of modeling results across multiple scenarios. This work reviews, implements and compares novel and existing techniques for finding equilibrium solutions for SBDTA problems, focusing on their convergence pa...

In this note we discuss the system optimum dynamic traffic assignment (SO-DTA) problem in the presence of time-dependent uncertainty on the demands and link capacities. We start from the deterministic linear programming formulation of the SO-DTA problem introduced by Ziliaskopoulos in [14], and then consider a robust version of the decision problem where the total travel time must be minimized ...

Advances in Intelligent Transportation Systems (ITS) have resulted in the deployment of surveillance systems that automatically collect and store extensive network-wide traffic data. Dynamic Traffic Assignment (DTA) models have also been developed for a variety of dynamic traffic management applications. Such models are designed to estimate and predict the evolution of congestion through detail...

This paper presents a dynamic traffic assignment (DTA) model for urban multi-modal transportation network by constructing a mesoscopic simulation model. Several traffic means such as private car, subway, bus and bicycle are considered in the network. The mesoscopic simulator consists of a mesoscopic supply simulator based on MesoTS model and a time-dependent demand simulator. The mode choice is...

The paper presents the calibration and application of a simulation-based dynamic traffic assignment (DTA) model on a portion of the City of Calgary road network in Alberta, Canada. The DTA model iteratively re-assigns flow to paths using the Method of Successive Averages (MSA), based on travel times obtained with a traffic simulation model. The original sub-network extracted from a regional pla...

We propose an on-line wavelength assignment algorithm for multi-fiber WDM networks, in which lightpaths are established and released dynamically. For a given number of fibers per link and number of wavelengths per fiber, the algorithm aims to minimize the blocking probability. It may also be used to reduce the number of wavelengths required for a given tolerable blocking probability. Simulation...

Dynamic traffic management strategies (e.g. perimeter control, gating) that benefit from macroscopic fundamental diagram (MFD) dynamics provided promising results regarding their effects on network capacity and performance. However, this raises the question of route choice behavior in case of heterogeneous urban networks, where different parts are modeled with separate MFD functions. In this st...