A note on the turn and arrival likelihood algorithms of traffic assignments

Yosef Sheffi

Transportation Research Part B: Methodological, 1979, vol. 13, issue 2, 147-150

Abstract: This note illustrates by means of examples that two of the three modifications of Dial's assignment algorithm suggested recently by Tobin (1977) should be subject to further research prior to implementation. Three potential problems with these algorithms are shown to be significant for small contrived networks.

Date: 1979
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0191-2615(79)90032-8
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:transb:v:13:y:1979:i:2:p:147-150

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Transportation Research Part B: Methodological is currently edited by Fred Mannering

More articles in Transportation Research Part B: Methodological from Elsevier
Bibliographic data for series maintained by Catherine Liu ().