动态用户最优配流问题的投影算法研究

A Projection Algorithm for Dynamic User Optimal Assignment Problem

本文首先建立了动态用户最优配流问题的变分不等式模型,并对此模型用投影算法来求解。本文中的模型满足Wordrop第一原理要求,所给算法在每一个小时段都能给出路段流入率、流出率及路段流量,从而为行人出行提供可靠的、实时的信息,所给数值实验也说明该模型和算法是可行且有效的。

In this paper, a variational inequality model for dynamic user optimal problem is proposed, and a project algorithm is designed to solve this model. The model satisfies Wordrop＇s first principle, and the travelers can chose the shortest path to their destination at any time and any decisive point. The algorithm of this paper can calculate, at each interval, the link inflow rates, the link outflow rates and the link flows, and steer the travelers.