Abstract
The mechanics of a traffic assignment model, that is able to assign coterminous trips to alternative routes without resorting to reiteration or path enumeration are described. Under a particular definition of, , reasonable path" the model satisfies certain common-sense requirements. Two algorithms are also presented that 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.