Selected node-pair analysis in dial's assignment algorithm

Dirck Van Vliet

Transportation Research Part B: Methodological, 1981, vol. 15, issue 1, 65-68

Abstract: An algorithm is proposed to calculate the matrix of trips which use a particular link in a road network or alternatively pass through a particular set of nodes given the route-splitting assumptions inherent in the Dial assignment algorithm.

Date: 1981
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0191-2615(81)90047-3
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:15:y:1981:i:1:p:65-68

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 ().