An algorithm to assign pedestrian groups dispersing at public gatherings based on pedestrian-traffic modelling

摘要: Abstract The minimization of weighted pedestrian and vehicle times for pedestrians dispersing at public gatherings is considered. An algorithm to solve this problem assign each group a unique selected path developed. This considers general network where its arc values are dependent on pedestrian/traffic modelling nodes (intersections) have penalties. followed by case study which exhibits possible models. These experimental models yield some deterministic functional dependency between pedestrians' speed sidewalk concentration, street vehicles' concentration. If such realistic serve as an input the it might contribute reduce conflicts interference hence increase overall safety these two travel modes.