Please use this identifier to cite or link to this item:
Title: A Link-Based alternative to Bell's Logit assignment algorithm
Authors: Lam, WHK 
Chan, KS
Keywords: Logit assignment and cycle problems
Stochastic traffic assignment
Issue Date: 1998
Publisher: Hong Kong Institution of Engineers
Source: HKIE transactions, 1998, v. 5, no. 2, p. 11-18 How to cite?
Journal: HKIE transactions 
Abstract: A Bell's logit assignment method was recently proposed as an alternative to Dial's algorithm. While retaining the absence of a need for path enumeration, Bell's method dispenses with either a forward or a backward pass. It therefore does not require minimum node-to-node cost information beforehand. The only constraint on the set of feasible paths imposed is that there are no loops and/or cycles. However, it is difficult to avoid loops in real networks. In order to minimize the cycle problems, a llnk-based alternative to Bell's logit assignment method is proposed with making use of the volume successive average algorithm. The absence of any efficiency constraint on the set of feasible paths makes the algorithm attractive for use in stochastic user equilibrium assignment. Extensions of the proposed method to limit the number and type of cycles permitted in the feasible path set are also discussed. Numerical examples are given to illustrate the applications of the proposed method and to compare the results with other assignment methods.
ISSN: 1023-697X
EISSN: 2326-3733
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

Last Week
Last month
Checked on Sep 18, 2017

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.