The algorithm is to minimize total travel time in the whole network by assigning traffic flow to links that have the lowest marginal link travel time at every time period.
该算法通过在每个时段把车流分配至边际行程时间最小的路段上,从而最小化交通系统内车辆的总运行时间。
A mathematical model is proposed to describe random network which has the same marginal distribution and the boundary condition as BA model.
给出一种严格的数学模型描述随机网络,该模型与BA模型有相同的边际分布和边界条件。
In this paper, we proposed a mathematical model to describe random network which has the same marginal distribution and the boundary condition as BA model.
本文给出一种严格的数学模型描述随机网络,该模型与BA模型有相同的边际分布和边界条件。
应用推荐