基于定向树搜索的博弈配流模型

通过将交通路网中路径搜索的定向式启发策略与深度优先的树搜索算法相结合,提出了一种有效路径的定向树搜索算法。该算法利用节点坐标划定有效搜索区,使搜索范围缩小。在具体的求解过程中一是利用已求出的节点位势确定下一步搜索的邻接节点范围,二是利用一个简单的节点估价函数确定进一步要选择的节点。通过给每一个节点一个搜索标记号来记录搜索树的分杈情况,可以顺利的实现有效路径的连续搜索,并结合博弈理论建立了新的交通流分配模型,给出了博弈配流的步骤。新模型合理反映了交通路网中出行者的出行路径决策行为,提供了唯一的路径流量解,因此便于在交通网络的灵敏度分析和优化设计中应用。最后,用一个简单算例说明了该方法的有效性。

A New Traffic Assignment Model Based on Orientated Tree Searching and Game Theory

Combining the directional heuristic strategy with the tree searching algorithm of depth priority,an orientated tree algorithm of searching efficient paths is proposed.Determining the efficient searching areas by using the coordinates of the nodes,the algorithm reduced the searching scope.During the solution,the algorithm determines the scope of searching adjacent nodes by using the known nodes' geopotential.Then it determines the nodes further to choose through the simple pricing function of nodes.Through marking the branch of the searching tree,the efficient path can be searched continuously.Based on the new algorithm of searching efficient paths and game theory,a new traffic assignment model is presented.The new model reasonably reveals the path choice decision-making process of travelers in traffic network.The unique path flow can be found out from the new method,so the method can be used in the analysis of the traffic network sensitivity and the optimal design of the network.A simple numerical example is given to show the new model's efficiency.