将优先黎曼求解器适配到道路网络上的GSOM
Adapting Priority Riemann Solver for GSOM on road networks
AI总结:
本文扩展了道路网络交通流的GSOM模型,提出基于优先规则的交叉口黎曼求解器及迭代算法,并首次详细分析了可增加通量变差的返回波现象。
摘要:
本文提出了道路网络上交通流的广义二阶模型(GSOM)的扩展。我们在交叉口定义了一个基于优先规则的黎曼求解器,并提供了一种迭代算法来构造具有n条进入道路和m条驶出道路的交叉口解。求解器的逻辑如下:在遵循优先规则的同时最大化流量,如果驶出道路的供应量超过了更高优先级进入道路的需求量,则可以调整优先规则。使用波前追踪构造柯西问题的近似解。我们建立了与交叉口相互作用的波的总变差界限,并给出了两条进入和两条驶出道路交叉口的显式计算。这项工作的一个关键创新是对返回波的详细分析——这些波在交叉口产生并在沿道路相互作用后返回交叉口——与LWR等一阶模型不同,它们会增加通量变差。
英文摘要:
In this paper, we present an extension of the Generic Second Order Models (GSOM) for traffic flow on road networks. We define a Riemann solver at the junction based on a priority rule and provide an iterative algorithm to construct solutions at junctions with n incoming and m outgoing roads. The logic underlying our solver is as follows: the flow is maximized while respecting the priority rule, which can be adjusted if the supply of an outgoing road exceeds the demand of a higher-priority incoming road. Approximate solutions for Cauchy problems are constructed using wave-front tracking. We establish bounds on the total variation of waves interacting with the junction and present explicit calculations for junctions with two incoming and two outgoing roads. A key novelty of this work is the detailed analysis of returning waves - waves generated at the junction that return to the junction after interacting along the roads - which, in contrast to first-order models such as LWR, can increase flux variation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。