微观仿真中的动态分配 行人的.pdfVIP

DYNAMIC ASSIGNMENT IN MICROSIMULATION S OF PEDESTRIANS 1 1,2 1 1 Authors: Tobias Kretz , Karsten Lehmann , Ingmar Hofsäß , Axel Leonhardt 1 Affiliation : PTV Group 1 Address : Haid-und-Neu-Straße 15, D-76131 Karlsruhe, Germany 2 Affiliation : init AG 2 Address : Käppelestraße 4-6, D-76131 Karlsruhe, Germany Email (corresponding author): Tobias.Kretz@ ABSTRACT A generic method for dynamic assignment used with microsimulation of pedestrian dynamics is introduced. As pedestrians – unlike vehicles – do not move on a network, but on areas they in principle can choose among an infinite number of routes. To apply assignment algorithms one has to select for each OD pair a finite (realistically a small) number of relevant representatives from these routes. This geometric task is the main focus of this contribution. The main task is to find for an OD pair the relevant routes to be used with common assignment methods. The method is demonstrated for one single OD pair and exemplified with an example. INTRODUCTION Finding and evaluating the user equilibrium network load for road networks (traffic assignment) is one of the core tasks of traffic planning. Various algorithms to solve this problem have been developed over the years (Wardrop, 1952) (Beckmann, McGuire, Winsten, 1956) (LeBlanc, Morlok, Pierskalla, 1975) (Bar-Gera, 2002) (Gentile Nökel, 2009). For readers who are not familiar with the concept of iterated assignment a short summary: the basic idea is to simulate (or compute) a scenario multiple times always computing the assignment on the routes based on the results of one or more or all previous simulations (iteration steps). The aim is to come up with a user-equilibirum route assignment which is –Wardrop’s principle – that no driver (or pedestrian) can achieve a smaller travel time by chang