考虑路段拥堵的最短时间流优化问题

Shortest Time Flow Optimization Problem Considering Congestion

针对以往对交通网络系统中路网时间流问题没有考虑网络拥塞的情况,研究了决策者如何制定最短时间流的决策问题,建立了静态数学规划模型,给出了模型的算法,讨论了算法的复杂性。随后,又对网络时间流问题进行了进一步的深入研究,分析了动态堵塞情形下的时间流特性,考虑交通网络堵塞程度对通过时间的影响,引进堵塞系数,构造动态时间函数,建立了在动态堵塞情况下的最短时间流模型,并给出了模型的算法,同时用算例验证了方法的有效性。

Aiming at the time flow problem of traffic network system without considering the case of network congestion in the past,how the policy makers make the minimum time flow decision problem is studied and a static mathematical programming model is proposed,then the model algorithm is given,the complexity of the algorithm is discussed.Next,the network time flow problem has been further studied,the dynamic plugging circumstances of the time stream is analyzed,the traffic network congestion degree of influence through time is considered and the congestion coefficient is introduced,then a dynamic time function is presented,the shortest time congestion flow model in dynamic condition is established and the algorithm is given based on the model.Finally,the validity of the method by an example is verified.