Study on the Reduced Traffic Congestion Method Based on Dynamic Guidance Information

This paper studies how to generate the reasonable information of travelers' decision in real network. This problem is very complex because the travelers' decision is constrained by different human behavior. The network conditions can be predicted by using the advanced dynamic OD(Origin-Destination, OD) estimation techniques. Based on the improved mesoscopic traffic model, the predictable dynamic traffic guidance information can be obtained accurately.A consistency algorithm is designed to investigate the travelers' decision by simulating the dynamic response to guidance information. The simulation results show that the proposed method can provide the best guidance information. Further,a case study is conducted to verify the theoretical results and to draw managerial insights into the potential of dynamic guidance strategy in improving traffic performance.     

无严格互补松驰条件的序列线性方程组新算法

该文通过构造特殊形式的有效集来逼近KKT点处的有效集，给出了一个任意初始点下的序列线性方程组新算法，并证明了该算法在没有严格互补松驰条件的情况下具有全局收敛性和一步超线性收敛性。      

一个使用增广拉格朗日函数的改进的SQP算法

通过引进一个辅助参数改变二次子规划的约束形式,使子问题总存在最优解.使用一个可微增广拉格朗日函数作为效益函数来确定步长,避免了Maratos效应.     

一种改进的公交配流模型与算法

对两种经典的公交配流模型进行了对比分析,指出了在考虑拥挤影响时两种模型进行公交配流各自存在的缺点.随后对两种模型存在的不足进行了原因分析,并在此基础上对Spiess和Florian提出的线性规划模型及算法进行了改进.改进的模型运用了“最优策略”和“有效频率”的思想,考虑了拥挤对站点乘客等车时间的影响.模型用MSA(相继平均法)算法进行求解,最后在一个简单网络上进行对比分析,表明改进后的模型能够较合理地求解考虑站点拥挤的公交配流问题.