Modification of dial's algorithm by redefining path efficiency

Abstract

Dial's multipath assignment algorithm assumes that trips are only assigned onto efficient paths. Hence the definition of efficient paths is a fundamental element of the algorithm. Dial has actually proposed two algorithms, each using a different definition of efficient paths. Algorithm 1 defines an efficient path as one that always moves further away from the origin and closer to the destination. Algorithm 2 defines an efficient path as one that always moves further away from the origin. This paper proposes a third definition and a third algorithm. Algorithm 3 redefines an efficient path as one that either always moves further away from the origin or one that always moves closer to the destination. A hypothetical grid network is used to illustrate the three different assignment algorithms.