WIT Press

Dynamic Transit Assignment Algorithms For Urban Congested Networks

Price

Free (open access)

Paper DOI

10.2495/UT990351

Volume

44

Pages

10

Published

1999

Size

978 kb

Copyright

WIT Press

Author(s)

Umberto Crisalli

Abstract

This paper reports fundamental aspects and implementative problems of dynamic transit assignment models. The first part describes the main features of the dynamic approach; successively dynamic network loading and equilibrium models are reported, as well as the relative algorithms of flow computation. Finally, algorithm convergence conditions are analysed and application results on a real-size test network are presented. 1 Introduction Transit assignment is usually treated by a static approach based on demand and supply average values using the hyperpath concept (Nguyen & Pallottino [7]). This approach, even if simple, results to be not acceptable at operative planning level, where it is necessary to explicitly simulate transi

Keywords