Deakin home > Deakin University Library > Deakin Research Online > An algorithm for logit network loading problem by topological sorting
Openly accessible

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.

Document type: Conference Paper
Collections: School of Architecture and Built Environment
Open Access Collection
Attached Files (Some files may be inaccessible until you login with your Deakin Research Online credentials)
Name Description MIMEType Size Downloads
liu-algorithmforlogit-2005.pdf liu-algorithmforlogit-2005.pdf application/pdf 673.35KB 15

Title An algorithm for logit network loading problem by topological sorting
Author(s) Li, Jun
Xin, Songxin
Liu, Chunlu
Conference name International Conference of the Eastern Asia Society for Transportation Studies (6th : 2005 : Bangkok, Thailand)
Conference location Bangkok, Thailand
Conference dates 21-24 September 2005
Title of proceedings EASTS 2005 : Gearing up for sustainable transport in Eastern Asia : Proceedings of the 6th International Conference of the Eastern Asia Society for Transportation Studies
Editor(s) Satoh, Keiichi
Publication date 2005
Start page 1209
End page 1217
Publisher Eastern Asia Society for Transportation Studies
Place of publication Bangkok, Thailand
Keyword(s) logit network loading
dial's algorithm
topological sort
Summary 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.
Notes
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 drosupport@deakin.edu.au
ISSN 1348-5393
Language eng
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
Copyright notice ©2005, Eastern Asia Society for Transportation Studies
Persistent URL http://hdl.handle.net/10536/DRO/DU:30014501
Connect to link resolver
 
Link to Related Work
 
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 drosupport@deakin.edu.au.

Versions
Version Filter Type
Access Statistics: 424 Abstract Views, 15 File Downloads  -  Detailed Statistics
Created: Tue, 21 Oct 2008, 14:23:32 EST