求解O-D需求估计双层规划模型的新算法

A new algorithm for solving the bi level programming model of origin destination demand estimates

给出了一个新的启发式求解算法——逐步更新比例矩阵法 ,用来求解基于 UE(User Equilibrium)准则的 O- D(Origin- Destination)需求估计的双层规划模型 (即 ,下层规划基于 U E准则 ,上层规划采用广义最小二乘思想 ,在拥挤网络上由路段交通流量观测值等前期数据来估计交通网络的 O- D需求量的双层规划模型 ) ,并进行了初步的数值试验。新的算法不仅能够给出 O- D需求的估计值 ,同时也能够给出路段交通流量的估计值。这个新的算法的思想也适用于其他下层规划基于

A new heuristic algorithm which updates the proportion matrix by steps is proposed for solving the bi level programming model of origin destination demand estimates. The algorithm is based on the UE (User Equilibrium) principle which uses the bi level programming model of origin destination demand estimates from link traffic counts in congested urban traffic networks. The lower level is based on the UE principle with the generalized least squares method used for the upper level. A simple numeral test is used to illustrate application of the new algorithm. The new algorithm simultaneously provides estimates of origin destination demands and the link traffic flows. This new algorithm is suitable for solving other bi level programming models when the lower level is based on the UE principle.