交通网络平衡配流问题的研究

【作者】 张永强；

【导师】 谭国真；

【作者基本信息】 大连理工大学 ， 计算机软件， 2001， 硕士

【摘要】 网络配流问题是交通工程领域中的重大理论问题，更是水资源领域、通信领域中的重要研究内容。在智能交通系统中，无论进行交通规划还是进行路径选择，交通配流都是核心问题。交通配流已引起大量专家学者的广泛注意。在前人研究的基础上，本文在平衡配流方面主要做了以下一些工作： 在静态平衡配流理论中，构建了完全基于路段的变分不等式模型，即目标函数和约束条件不含有路径参数。由于该模型是完全基于路段的，从而克服了基于路径方法必须进行路径穷举的缺陷。该模型是与Wolfe用户平衡条件是等价的，即：对任意起止点对，所有被选用的路径上的旅行时间是最小的，而未被选用的路径上的旅行时间都大于或等于被选用路径上的旅行时间。提出了最优路径选择算法用以求解该变分不等式模型并为交通网络中的群体车辆进行路径诱导。经试验结果，表明本文的模型和算法是正确和有效的。 在动态平衡配流理论中，给出了用于动态路径选择的基于路段的变分不等式模型。该模型满足动态用户最优条件，即：任意起止点对间，同一时间段出发的所有用户到达目的地时所经历的时间是相等的，并且是最小的。使用嵌套对角线算法求解该变分不等式模型。提出了群体车辆的动态路径选择算法用于为交通网络中的每个车辆寻找最优行驶路径。 针对交通需求矩阵不易获得的问题，本文给出了用于交通预测的极大熵模型，这样根据获得的路段上交通量数据和历史交通需求矩阵数据，可以预测得到现在的交通需求矩阵。使用牛顿法求解该极大熵模型，提出了一些非常有效的数据结构及算法，包括稀疏矩阵的存储与使用以及逆阵的求解等。最后用算例说明极大熵模型求得的O-D矩阵的可靠性和求解算法及数据结构的有效性。更多还原

【Abstract】 Network flow assignment is a significant theorical problem and an important research subject in the field of the communication and water resource. In the intelligent transportation system, traffic flow assignment is the core of the traffic regulation and path choice problems. It has attracted many researchers. Based on the others’ research in traffic flow assignment, we do some work as follows:In the theory of static traffic flow assignment, we formulate a completely link-based variational inequality (VI) model, whose objective function and constraint conditions do not have the path variables. Since the model is completely link-based, we need not enumerate all the paths to evaluate this model. This model is equivalent to the user equilibrium (UE) condition, that is, for each origin-destination pair, the travel time on all the used paths is equal and minimal; the travel time on the unused paths is greater than or equal to the minimal travel time. We present an optimal path choice algorithm to solve the VI model and determine an optimal path for each vehicle in the traffic network. An example is given to show that the model and the algorithm are right and effective.In the theory of dynamic flow assignment, we present a link-based VI model for the dynamic path choice. This model satisfies the dynamic user optimal condition, i.e., for each Origin-Destination pair, the path travel time experienced by travelers departing during the same interval is equal and minimal. We present the nested diagonalization method. We then put up a dynamic path choice algorithm to determine an optimal path for each vehicle in the traffic network.Since the traffic demand matrix is difficult to obtain, we present a discrete time-dependent maximum entropy (ME) approach to estimate the origin-destination trip matrices in transit network. The Newton method is applied to solve this optimization model of ME model. Then some efficient algorithms and data structures are put up, including the storage and application of the sparse matrix and the evaluation of the reverse matrix. An example is given to show that the origin-destination trip matrices which is gained by the ME model has a high reliability and the data structures and algorithms are very efficient.更多还原