arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.00099math.OCcs.LG
收藏

城市交通动态起讫点矩阵估计方法的比较

A Comparison of Different Approaches to Dynamic Origin-Destination Matrix Estimation in Urban Traffic

University of Southern Denmark (SDU)(南丹麦大学)

Nicklas Sindlev Andersen, Marco Chiarandini, Kristian Debrabant

摘要:

给定穿越交通网络的道路的车辆的计数器,我们重建产生它们的出行需求,表示为用户进行的起点-目的地行程的数量。我们将问题建模为一个双层最优化问题。在内部层次,给定一个试探性的需求,我们解决了动态交通分配(DTA)问题,以决定他们的起源和目的地之间的用户的路由。最后,我们调整出行的数量和他们的起点和目的地在外层,以最大限度地减少计数器产生的内部水平和交通网络中的传感器测量的给定车辆计数之间的差异。我们解决了DTA问题,采用介观模型实现的交通模拟器SUMO。因此,外部问题变成使由仿真结果确定的黑盒目标函数(OF)最小化的最优化问题,这是高成本的计算。我们研究了不同的方法来分类为基于梯度和衍生物的方法的外层问题。在基于梯度的方法中,我们研究了基于分配矩阵的方法和使用同时扰动随机逼近(SPSA)算法的无分配矩阵方法。在无导数方法中,我们研究机器学习(ML)算法来学习模拟器的模型,然后可以将其用作最优化问题中的替代OF。我们比较这些方法计算上的人工网络。基于梯度的方法在解的质量和计算要求方面表现最好。相比之下,ML方法获得的结果目前不太令人满意,但为未来的研究提供了一个有趣的途径。

英文摘要:

Given the counters of vehicles that traverse the roads of a traffic network, we reconstruct the travel demand that generated them expressed in terms of the number of origin-destination trips made by users. We model the problem as a bi-level optimization problem. At the inner-level, given a tentative demand, we solve a Dynamic Traffic Assignment (DTA) problem to decide the routing of the users between their origins and destinations. Finally, we adjust the number of trips and their origins and destinations at the outer-level to minimize the discrepancy between the counters generated at the inner-level and the given vehicle counts measured by sensors in the traffic network. We solve the DTA problem by employing a mesoscopic model implemented by the traffic simulator SUMO. Thus, the outer problem becomes an optimization problem that minimizes a black-box Objective Function (OF) determined by the results of the simulation, which is a costly computation. We study different approaches to the outer-level problem categorized as gradient-based and derivative-free approaches. Among the gradient-based approaches, we look at an assignment matrix-based approach and an assignment matrix-free approach that uses the Simultaneous Perturbation Stochastic Approximation (SPSA) algorithm. Among the derivative-free approaches, we investigate Machine Learning (ML) algorithms to learn a model of the simulator that can then be used as a surrogate OF in the optimization problem. We compare these approaches computationally on an artificial network. The gradient-based approaches perform the best in terms of solution quality and computational requirements. In contrast, the results obtained by the ML approach are currently less satisfactory but provide an interesting avenue for future research.

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

↑