Modelling and solving dynamic entry pedestrian flow assignment problem

In this paper, a dynamic entry pedestrian flow assignment problem is investigated. The problem concerns a scenario, i.e. a number of pedestrians enter a public place with multiple entrances and internal obstacles, and then get to their destinations in the public place. The problem aims at determining the access entrance, moving route, and destination position choice of pedestrians so as to minimize the total entry time of all pedestrians. A mesoscopic model is developed to formulate the dynamic entry process of pedestrians in the scenario and a heuristic algorithm is proposed to solve the dynamic entry pedestrian flow assignment problem. Moreover, a set of numerical investigations are provided to demonstrate the applications of the model and the effectiveness of the algorithm, especially to a case with a larger number of entry pedestrians.

Automated summary

This paper investigates the dynamic entry pedestrian flow assignment problem. The problem involves a scenario where pedestrians enter a public place with multiple entrances and internal obstacles and then proceed to their destinations. The objective is to determine the entrance, route, and destination choices of pedestrians in order to minimize their total entry time. A mesoscopic model is developed to describe the dynamic entry process and a heuristic algorithm is proposed to solve the problem. Numerical investigations are conducted to demonstrate the model's applications and the effectiveness of the algorithm, particularly for a larger number of entry pedestrians.