arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1606.07418math.AP
收藏

基于优先级的网络业务流黎曼解算子

Priority-based Riemann solver for traffic flow on networks

Maria Laura Delle Monache, Paola Goatin, Benedetto Piccoli

摘要:

在这篇文章中,我们介绍了一个新的黎曼解算子的网络上的业务流。优先级黎曼解算子(PRS)通过考虑引入道路的优先级和通过流量的最大化来提供交叉点处的解决方案。我们证明了存在的解决方案的解决方案的交界处与两个传入和两个传出的道路,并显示数值与以前的黎曼解算子的比较。此外,我们介绍了第二个版本的求解器,认为软约束的优先级,并说明了两个求解器之间的差异。

英文摘要:

In this article we introduce a new Riemann solver for traffic flow on networks. The Priority Riemann solver (PRS) provides a solution at junctions by taking into consideration priorities for the incoming roads and maximization of through flux. We prove existence of solutions for the solver for junctions with up to two incoming and two outgoing roads and show numerically the comparison with previous Riemann solvers. Additionally, we introduce a second version of the solver that considers the priorities as softer constraints and illustrate numerically the differences between the two solvers.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑