A DYNAMIC MODEL OF MULTIPLE PATH TRAFFIC ASSIGNMENT
摘要
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.
引用本文（GB/T 7714）
王炜. A DYNAMIC MODEL OF MULTIPLE PATH TRAFFIC ASSIGNMENT[J]. 东南大学学报：英文版, 1991.
引文网络
本站仅收录题录与摘要供学习参考，全文版权归属出版方；如有侵权请联系我们删除。