AbstractTo support planning, design, and management of pedestrian infrastructure, dynamic assignment models are useful tools. However, current models are network-based and presume that travelers can choose between a finite number of discrete route alternatives. For walking facilities, where pedestrians can choose their paths freely in two-dimensional space, applicability of these traditional network models is limited. This article puts forward an approach for user-optimal dynamic assignment in continuous time and space. Contrary to network-based approaches, the theory allows the traffic units to choose from an infinite non-countable set of paths through the considered space. The approach consists of three interrelated steps, that is: determining the continuous paths using a path choice model, assigning the origin–destination flows, and calculating the resulting traffic conditions. The approach to determine a user-optimal assignment is heuristic and consists of a sequence of all-or-nothing assignments in continuous time-space. The article presents the mathematical problem formulation, solution approaches, and application examples.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Dynamic user-optimal assignment in continuous time and space


    Contributors:

    Published in:

    Publication date :

    2002-12-16


    Size :

    22 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Dynamic user-optimal assignment in continuous time and space

    Hoogendoorn, Serge P. | Online Contents | 2004


    A Combinatorial user optimal dynamic traffic assignment algorithm

    Waller, S. T. / Ziliaskopoulos, A. K. | British Library Conference Proceedings | 2006


    Dynamic user optimal traffic assignment on congested multidestination networks

    Wie, Byung-Wook / Friesz, Terry L. / Tobin, Roger L. | Elsevier | 1990


    Dynamic User Optimal Assignment Problem Based on Greenshields Model

    Ren, H. / Gao, Z. / Lian, A. et al. | British Library Conference Proceedings | 2006