We present an efficient algorithm to identify which edge should be improved in a traffic network to minimize the total travel time. Our main result is to show that it is possible to approximate the variation of total travel time obtained by changing the congestion coefficient of any given edge, by performing only local computations, without the need of recomputing the entire equilibrium flow. To obtain such a result, we reformulate our problem in terms of the effective resistance between two adjacent nodes and suggest a new approach to approximate such effective resistance. We then study the optimality of the proposed procedure for recurrent networks, and provide simulations over synthetic and real transportation networks.

中文翻译：

---

交通网络中的最佳干预

我们提出一种有效的算法，以识别交通网络中应改善的边缘，以最大程度地缩短总行驶时间。我们的主要结果表明，通过仅执行局部计算，而无需重新计算整个平衡流，就可以近似估计通过更改任何给定边缘的拥塞系数而获得的总行驶时间的变化。为了获得这样的结果，我们根据两个相邻节点之间的有效电阻重新构造了我们的问题，并提出了一种近似这种有效电阻的新方法。然后，我们研究了针对递归网络的拟议程序的最优性，并提供了综合和实际运输网络的仿真。