英文:
What is the Route cost calculation formula from using DUA router in SUMO?
问题
使用DUA路由器计算路由成本的公式是什么？
我已经从在DUA路由器中设置的TAZ（O-D矩阵）中获得了路由（相邻的边缘连接），但无法解释每辆车的路由是如何形成的。
我认为主要是通过旅行时间和拥堵水平。
如果我无法知道确切的路由成本计算公式，主要因素是什么？
是否有工具可以根据模拟的拥堵情况分配路由？
如果路由是由DUA路由器确定的最快路线，并且如果每个入口方向的结果都相同，那么最终会发生拥堵。
我尝试了dualterate.py，但一直出现错误。我在DUArouter配置中使用了相同的输入XML文件。
我想可能有自动路由（https://sumo.dlr.de/docs/Demand/Automatic_Routing.html），但我猜我的网络只有一个信号控制的交叉口，所以我可能会在更大的交叉口尝试一下。
*在SUMO netedit中创建了一个信号控制的交叉口，并在SUMO cfg中运行不同的案例。
英文:
What is the Route cost calculation formula from using DUA router?
I've gotten routes(adjacent edges connected) from setting TAZ(O-D matrix) in DUA router, but cannot interpret how routes of each vehicles are formed.
I assume it's mainly by travel time and congestion level.
If I cannot know the exact Route cost calculation formula, what are the main factors of it?
Are there a tool for assigning routes based on the simulation's congestion?
If the routes are defined by the fastest route by DUA router, and if the results are same for each entry direction, congestion will happen after all.
I tried dualterate.py, but keep getting errors. I used the same input xml files for DUArouter configuration.
I assume there is Automatic Routing(https://sumo.dlr.de/docs/Demand/Automatic_Routing.html), but it I guess my network is just one signalized intersection, so I might try at a bigger intersection.
*Made one signalized intersection in SUMO netedit and running with different cases in SUMO cfg
答案1
得分: 0
默认情况下，duarouter使用特定边上的行驶时间作为成本，并对经过的边进行求和。这些行驶时间可以作为输入提供，或者（如果没有提供）可以通过将长度除以允许的最大速度（对于给定车辆类型的车辆）来计算。您说得对，默认情况下会导致拥堵，这就是duaIterate存在的原因。这将迭代地运行模拟，并生成具有模拟行驶时间的输出，并将其反馈给duarouter，后者将找到可能的新最快路径。然而，这种机制只对较大的网络有意义。对于单个交叉口，最简单的方法可能是手工制定路线。
关于duaIterate的错误，请提出单独的问题或直接在https://github.com/eclipse/sumo/issues上提出问题。
英文:
By default duarouter uses travel time on the specific edge as cost and sums over the traveled edges. Those travel times can either be given as input or (if not) are calculated by dividing length by maximum allowed speed (for the given vehicle type of a vehicle). You are right that the default case will lead to congestion and that is the reason why duaIterate exists. This will iteratively run the simulation and generate outputs with the simulated travel times and will feed them back to the duarouter which finds possibly new fastest routes. This mechanism however makes only sense for bigger networks. For a single intersection it is probably easiest to craft the routes by hand.
For the duaIterate errors please ask a separate question or open an issue directly at https://github.com/eclipse/sumo/issues.
通过集体智慧和协作来改善编程学习和解决问题的方式。致力于成为全球开发者共同参与的知识库，让每个人都能够通过互相帮助和分享经验来进步。
评论