Probabilistic Assignment: An Algorithm

Michel Trahan
Additional contact information
Michel Trahan: Université de Montréal, Montréal, Québec, Canada

Transportation Science, 1974, vol. 8, issue 4, 311-320

Abstract: This note describes improvements to the assignment algorithm Dial presented to implement his multipath assignment method. It illustrates the advantages of Robillard's refinement over the original Dial approach in terms of savings in computation time as well as in core storage. Moreover, the note provides some figures on the necessary amount of computation time on a particular computer.

Date: 1974
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.8.4.311 (application/pdf)

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:inm:ortrsc:v:8:y:1974:i:4:p:311-320

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().