Perimeter control for congested areas of a large-scale traffic network: A method against state degradation risk

2020 ◽  
Vol 112 ◽  
pp. 28-45 ◽  
Author(s):  
Heng Ding ◽  
Jingwen Zhou ◽  
Xiaoyan Zheng ◽  
Liangyuan Zhu ◽  
Haijian Bai ◽  
...  
Author(s):  
Leigh McCue

Abstract The purpose of this work is to develop a computationally efficient model of viral spread that can be utilized to better understand influences of stochastic factors on a large-scale system - such as the air traffic network. A particle-based model of passengers and seats aboard a single-cabin 737-800 is developed for use as a demonstration of concept on tracking the propagation of a virus through the aircraft's passenger compartment over multiple flights. The model is sufficiently computationally efficient so as to be viable for Monte Carlo simulation to capture various stochastic effects, such as number of passengers, number of initially sick passengers, seating locations of passengers, and baseline health of each passenger. The computational tool is then exercised in demonstration for assessing risk mitigation of intervention strategies, such as passenger-driven cleaning of seating environments and elimination of middle seating.


2018 ◽  
Vol 80 ◽  
pp. 32-49 ◽  
Author(s):  
Elvira Thonhofer ◽  
Toni Palau ◽  
Andreas Kuhn ◽  
Stefan Jakubek ◽  
Martin Kozek

2021 ◽  
Author(s):  
Diouf Ndolane ◽  
Ndong Massa ◽  
Diop Dialo ◽  
Talla Kharouna ◽  
Beye Chedikh Aboubaker ◽  
...  

2012 ◽  
Vol 238 ◽  
pp. 503-506 ◽  
Author(s):  
Zhi Cheng Li

The successful application of Intelligent Transportation Systems (ITS) depends on the traffic flow at any time with high-precision and large-scale assessments, it is necessary to create a dynamic traffic network model to evaluate and forecast traffic. Dynamic route choice model sections of the run-time function are very important to the dynamic traffic network model. To simplify the dynamic traffic modeling, improve the calculation accuracy and save computation time, the flow on the section of the interrelationship between the exit flow and number of vehicles are analyzed, a run-time functions into the flow using only sections of the said sections are established.


1997 ◽  
Vol 123 (4) ◽  
pp. 276-282 ◽  
Author(s):  
David E. Boyce ◽  
Der-Horng Lee ◽  
Bruce N. Janson ◽  
Stanislaw Berka

Author(s):  
Aleksandr Saprykin ◽  
Ndaona Chokani ◽  
Reza S. Abhari

AbstractAgent-based models for dynamic traffic assignment simulate the behaviour of individual, or group of, agents, and then the simulation outcomes are observed on the scale of the system. As large-scale simulations require substantial computational power and have long run times, most often a sample of the full population and downscaled road capacities are used as simulation inputs, and then the simulation outcomes are scaled up. Using a massively parallelized mobility model on a large-scale test case of the whole of Switzerland, which includes 3.5 million private vehicles and 1.7 million users of public transit, we have systematically quantified, from 6 105 simulations of a weekday, the impacts of scaled input data on simulation outputs. We show, from simulations with population samples ranging from 1% to 100% of the full population and corresponding scaling of the traffic network, that the simulated traffic dynamics are driven primarily by the flow capacity, rather than the spatial properties, of the traffic network. Using a new measure of traffic similarity, that is based on the chi-squared test statistic, it is shown that the dynamics of the vehicular traffic and the occupancy of the public transit are adversely impacted when population samples less than 30% of the full population are used. Moreover, we present evidence that the adverse impact of population sampling is determined mostly by the patterns of the agents’ behaviour rather than by the traffic model.


2013 ◽  
Vol 2013 ◽  
pp. 1-5 ◽  
Author(s):  
Jing Wang ◽  
Jianming Zhu ◽  
Haoxiong Yang

After natural disaster, especially for large-scale disasters and affected areas, vast relief materials are often needed. In the meantime, the traffic networks are always of uncertainty because of the disaster. In this paper, we assume that the edges in the network are either connected or blocked, and the connection probability of each edge is known. In order to ensure the arrival of these supplies at the affected areas, it is important to select a reliable path. A reliable path selection model is formulated, and two algorithms for solving this model are presented. Then, adjustable reliable path selection model is proposed when the edge of the selected reliable path is broken. And the corresponding algorithms are shown to be efficient both theoretically and numerically.


Sign in / Sign up

Export Citation Format

Share Document