Algorithm research for capacity-constrained stochastic traffic assignment model Online publication date: Sat, 26-Jul-2014
by Yong Yang; Yu-Song Yan; Zuo-An Hu; Pan Xie
International Journal of Information and Communication Technology (IJICT), Vol. 6, No. 3/4, 2014
Abstract: The paper presents incremental load algorithm and successive equilibrium algorithm to solve the stochastic capacity-constrained traffic assignment model on the base of combining the Fisk's logit assignment optimal theory and Wardrop's optimisation principals. A system optimal quantitative indicator based on minimum O-D average cost principal is developed to evaluate the traffic flow assignment result. The simulation results for a small traffic network show that more reasonable traffic assignment is achieved when using more batches and optimal batch ratios with incremental load algorithm, while, the overall result is superior utilising successive equilibrium algorithm.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Communication Technology (IJICT):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com