Development of Parallel Algorithms for Intelligent Transportation Systems
Development of Parallel Algorithms for Intelligent Transportation Systems
复制标题
智能交通系统并行算法的开发
DOI：
10.3390/math10040643
复制
发表时间：
2022
期刊：
影响因子：
2.4
通讯作者：
M. Trapeznikova
中科院分区：
文献类型：
--
作者：
B. Chetverushkin;A. Chechina;N. Churbanova;M. Trapeznikova
本文讨论了在现代超级计算机上实现宏观和微观交通流模型的并行算法的创建。高性能计算有助于基于信息技术的智能交通系统的发展，旨在有效地调节大城市的交通。从宏观角度出发，提出了用显式有限差分格式近似的准气体动力交通模型。考虑了系统的一维和二维变量，讨论了横向速度的概念和求解横向速度的不同方程。微观方法用多车道元胞自动机模型表示。根据Kerner的三相理论，对先前开发的模型进行了扩展，以再现同步流动。新版本从Kerner-Klenov-Schreckenberg-Wolf模型开始，并使用同步间隙的概念进行操作。宏观模型与确定道路交通的共同特征有关，而微观模型则有助于详细描述汽车的运动。这两种方法都具有内在的并行性。并行算法基于几何并行原理，在子域的界面处设置不同的边界条件。当多达100个处理器参与计算时，达到了足够高的速度。所提出的算法可以作为ITS的核心。
This paper deals with the creation of parallel algorithms implementing macro-and microscopic traffic flow models on modern supercomputers. High-performance computing contributes to the development of intelligent transportation systems based on information technologies and aimed at the effective regulation of traffic in large cities. As a macroscopic approach, the quasi-gas-dynamic traffic model approximated by explicit finite-difference schemes is proposed. One- and two-dimensional variants of the system are considered, and the concept of lateral velocity and different equations for obtaining it are discussed. The microscopic approach is represented by the multilane cellular automata model. The previously developed model is extended to reproduce synchronized flow in accordance with Kerner’s three-phase theory. The new version starts from the Kerner–Klenov–Schreckenberg–Wolf model and operates with the concept of the synchronization gap. Macroscopic models are relevant for determining the common characteristics of road traffic, while microscopic models are useful for a detailed description of cars’ movement. Both approaches possess inner parallelism. The parallel algorithms are based on the geometrical parallelism principle with different boundary conditions at interfaces of the subdomains. Sufficiently high speedups were reached when up to 100 processors were involved in calculations. The proposed algorithms can serve as the core of ITS.