z-logo
open-access-imgOpen Access
Walking infrastructure design assessment by continuous space dynamic assignment modeling
Author(s) -
Hoogendoorn Serge P.,
Bovy Piet. H. L.,
Daamen Winnie
Publication year - 2004
Publication title -
journal of advanced transportation
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.577
H-Index - 46
eISSN - 2042-3195
pISSN - 0197-6729
DOI - 10.1002/atr.5670380106
Subject(s) - computer science , space (punctuation) , heuristic , set (abstract data type) , countable set , sequence (biology) , traffic flow (computer networking) , flow network , flow (mathematics) , mathematical optimization , simulation , mathematics , artificial intelligence , computer network , geometry , combinatorics , biology , genetics , programming language , operating system
For the planning and design of walking infrastructure, characterized by the fact that the pedestrians can choose their paths freely in two‐dimensional space, applicability of traditional discrete network models is limited. This contribution puts forward an approach for user‐optimal dynamic assignment in continuous time and space for analyzing for instance walking infrastructure in a two‐dimensional 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 first determines the continuous paths using a path choice model. Then, origin‐destination flows are assigned and traffic conditions are calculated. The approach to determine a user‐optimal assignment is heuristic and consists of a sequence of all‐or‐nothing assignments. An application example is presented, showing dynamic user equilibrium traffic flows through a realistic transfer station. The example is aimed at illustrating the dynamic aspects of the modeling approach, such as anticipation on expected flow conditions, and predicted behavior upon catching or missing a connection.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here