Abstract
In the method developed and tested, the algorithms used for building the multiple-route trees are the same as those used in most conventional minimum path assignment programs, except that a different set of link costs is used to build each tree.