 Dynamic user-optimal assignment in continuous time and spaceSerge P. Hoogendoorn and Piet H. L. Bovy Transportation Research Part B: Methodological, 2004, vol. 38, issue 7, 571-592 Abstract: To 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. Date: 2004 Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:transb:v:38:y:2004:i:7:p:571-592 Ordering information: This journal article can be ordered from Access Statistics for this article Transportation Research Part B: Methodological is currently edited by Fred Mannering More articles in Transportation Research Part B: Methodological from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.