摘要
A “Random Shortest Path”traffic assignment model and its algorithm arepresented by simulating the trip-makers’route-choice characters,and the dynamic meth-od is introduced in the assignment model.It is a ideal multiple path assignment modelwhich can be carried out by the dynamic method and static method,can better reflect boththe shortest path factor and the random factor in the route-choice,and is of reasonableassignment volumes.Besides,both dynamic and static softwares particularly suited to thetraffic assignment of large and medium-sized transportation networks arc developed.
A “Random Shortest Path”traffic assignment model and its algorithm are presented by simulating the trip-makers'route-choice characters,and the dynamic meth- od is introduced in the assignment model.It is a ideal multiple path assignment model which can be carried out by the dynamic method and static method,can better reflect both the shortest path factor and the random factor in the route-choice,and is of reasonable assignment volumes.Besides,both dynamic and static softwares particularly suited to the traffic assignment of large and medium-sized transportation networks arc developed.
基金
The Project Supported by National Natural Science Foundation of China
