An algorithm for logit network loading problem by topological sorting
Li, Jun, Xin, Songxin and Liu, Chunlu 2005, An algorithm for logit network loading problem by topological sorting, in EASTS 2005 : Gearing up for sustainable transport in Eastern Asia : Proceedings of the 6th International Conference of the Eastern Asia Society for Transportation Studies, Eastern Asia Society for Transportation Studies, Bangkok, Thailand, pp. 1209-1217.
(Some files may be inaccessible until you login with your Deakin Research Online credentials)
This paper presents a topological sorting based algorithm for logit network loading problem to exclude all cycles by removing certain links from loops. The new algorithm calculates the link weights and flows according to topological order. It produces the theoretical results for networks without loops. Numerical examples show that the new algorithm can reduce errors introduced by the strict definition of 'reasonable route' in Dial's algorithm.
Every reasonable effort has been made to ensure that permission has been obtained for items included in Deakin Research Online. If you believe that your rights have been infringed by this repository, please contact firstname.lastname@example.org
Field of Research
090507 Transport Engineering 099999 Engineering not elsewhere classified
Socio Economic Objective
970109 Expanding Knowledge in Engineering
HERDC Research category
E2 Full written paper - non-refereed / Abstract reviewed
Unless expressly stated otherwise, the copyright for items in Deakin Research Online is owned by the author, with all rights reserved.
Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO.
If you believe that your rights have been infringed by this repository, please contact email@example.com.