A Turn-Based Algorithm for Solving the Logit Type Network Loading Problem

By analyzing the topological relationships between network elements, this paper extends a turn-based algorithm for the network loading of logit type, which has a structure similar to Dial´s algorithm. Based on the conservation of flows on links, the algorithm computes directly the link flow and turn flow pattern that not only agrees with the logit path-choice process but also takes into account the effect of turn delays on network loading. The proposed algorithm deals with turn delays and turn flows in an explicit and direct way that avoids the disadvantages of the conventional network-expanding method, which is widely used for modeling turning movements in network models. The computational results from realistic networks confirm the superior performance of the proposed algorithm, in terms of time efficiency, over the combination of the network-expanding method and Dial´s algorithm.