В работе описывается двухстадийная модель равновесного распределения транспортных потоков. Модель состоит из двух блоков, где первый блок — расчета матрицы корреспонденций, а второй потоков по путям. Первая модель, используя матрицу затрат (затраты на перемещение одного района в другой, данном случае время), рассчитывает описывающую потребности объемах передвижения другой район. Для решения это...

Traffic information systems have become a major issue in many countries as a modern technology for alleviating traffic congestion in urban areas. Pre-trip or en-route real-time travel information regarding traffic conditions can enhance drivers’ knowledge of the situation in road networks and may assist in drivers’ decisions such as the choice of departure time, route, and destination. In facts...

We present a novel decentralized and infrastructure-less algorithm to alleviate traffic congestions on road networks and to fill the void left by current algorithms which are either static, centralized, or require infrastructure. The algorithm follows an online approach that seeks stochastic user equilibrium and assigns traffic as it evolves in real time, without prior knowledge of the traffic ...

Solving traffic equilibrium problem, or “traffic assignment”, as the last step in Transportation Planning, distributes OD trip demands of a transportation network over the network links with regard to Traffic Equilibrium Law, and estimates the link flows. In formulations of traffic equilibrium which are based on path saving, the memory consumption is considerably affected by the number of effct...

The development and calibration of complex traffic models demands parsimonious techniques, because such models often involve hundreds of thousands of unknown parameters. The Weighted Simultaneous Perturbation Stochastic Approximation (W-SPSA) algorithm has been proven more efficient than its predecessor SPSA (Spall, 1998), particularly in situations where the correlation structure of the variab...

IYER, VIJAY R. A Simulation Study of Wavelength Assignment and Reservation Policies with Signaling Delays. (Under the direction of Professor George N. Rouskas). This thesis studies the effect of non-negligible signaling delays on the performance of wavelength-assignment heuristics, wavelength reservation schemes, routing schemes, holding time (average being 1/μ) of the lightpaths and traffic lo...

Solving traffic equilibrium problem, or “traffic assignment”, as the last step in Transportation Planning, distributes OD trip demands of a transportation network over the network links with regard to Traffic Equilibrium Law, and estimates the link flows. In formulations of traffic equilibrium which are based on path saving, the memory consumption is considerably affected by the number of effct...

Training neural networks with discrete stochastic variables presents a unique challenge. Backpropagation is not directly applicable, nor are the reparameterization tricks used in continuous variables. To address this challenge, we present Hindsight Network Credit Assignment (HNCA), novel gradient estimation algorithm for of units. HNCA works by assigning credit to each unit based on degree whic...