A probabilistic multipath traffic assignment model which obviates path enumeration.

Following a brief discussion of shortcomings of all-or-nothing assignment and of prior efforts in multipath assignment, two algorithms are presented, both of which yield results with the above properties. The algorithms differ in their definition of a reasonable path and in the number of times each is executed to assign all trips from a given origin node.