Optimising pedestrian flow in a topological network using various pairwise speed-density models

Abstract

A speed-density model can be utilised to efficiently flow pedestrians in a network. However, how each model measures and optimises the performance of the network is rarely reported. Thus, this paper analyses and optimises the flow in a topological network using various speed-density models. Each model was first used to obtain the optimal arrival rates to all individual networks. The optimal value of each network was then set as a flow constraint in a network flow model. The network flow model was solved to find the optimal arrival rates to the source networks. The optimal values were then used to measure their effects on the performance of each available network. The performance results of the model were then compared with that of other speed-density models. The analysis of the results can help decision-makers understand how arrival rates propagate through traffic and determine the level of the network throughputs.