An algorithm for logit network loading problem by topological sorting
Contribuinte(s) |
Satoh, Keiichi |
---|---|
Data(s) |
01/01/2005
|
Resumo |
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.<br /> |
Identificador | |
Idioma(s) |
eng |
Publicador |
Eastern Asia Society for Transportation Studies |
Relação |
http://dro.deakin.edu.au/eserv/DU:30014501/liu-algorithmforlogit-2005.pdf http://www.easts.info/on-line/proceedings_05/1209.pdf |
Direitos |
2005, Eastern Asia Society for Transportation Studies |
Palavras-Chave | #logit network loading #dial's algorithm #topological sort |
Tipo |
Conference Paper |