Curbing the computational difficulty of the logit equilibrium assignment model
In the past, research in traffic assignment modeling has been directed primarily towards improving the deterministic model. Alternative, more behavioral principles were thought to be too demanding computationally. This paper presents two mathematical contributions that enable one to solve a logit assignment model with flow-dependent travel times at a reduced cost. First, a convergence test for Fisk's minimization program is introduced, based on a duality gap principle. Second, a new definition of Dial's STOCH fixedtime logit assignment procedure is given, in which the set of available paths is defined only once and the computations are re-interpreted. A numerical experiment indicates that these tools make the logit assignment model very competitive compared to the procedures conventionally used for solving the deterministic model.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 31 (1997)
Issue (Month): 4 (August)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Leurent, Fabien, 1993. "Cost versus time equilibrium over a network," European Journal of Operational Research, Elsevier, vol. 71(2), pages 205-221, December.
- Fukushima, Masao, 1984. "On the dual approach to the traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 18(3), pages 235-245, June.
- Mingyuan Chen & Attahiru Sule Alfa, 1991. "Algorithms for solving fisk's stochastic traffic assignment model," Transportation Research Part B: Methodological, Elsevier, vol. 25(6), pages 405-412, December.
When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:31:y:1997:i:4:p:315-326. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.