A novel path-generating Logit traffic assignment algorithm

This paper presents a novel path-generating Logit traffic assignment algorithm. In each iteration, this algorithm assigns O–D traffic demand to the generated paths set up to now by Logit method and updates links traffic volume as well as links traveling time correspondingly, then generates shortest path according to current links traveling time. Traffic assignment is finished until no new path can be generated. As this algorithm avoids paths enumeration, so it is suitable for applying to large scale road network. Numerical examples show that it is effective and efficient.