In the paper, a routing algorithm of two sub-algorithms is proposed for consideration of tactical decisions in a microscopic crowd simulation. One sub-algorithm works in the high or macroscopic level and is used to determine the departure door, which would suffer a later change, whenever pedestrians firstly enter rooms. The sub-algorithm is based on a tailored Dijkstra shortest-path algorithm with introduction of the concept of impedance conduction for considering congestion along paths. The other sub-algorithm works in the low or microscopic level and is supposed to work with any chosen microscopic crowd dynamics model. It is mainly used to model dynamic changes of pedestrians’ departure doors while they are walking inside rooms. Many mechanisms are introduced for considering practical factors affecting pedestrians’ routing behaviors, for example consideration of congestion of segments between pedestrians and doors, consideration of impact of re-selection of previous doors, etc. According to conducted numerical experiments, the proposed algorithm can well model crowd’s tactical decisions in a microscopic simulation under various scenarios, thus is a suitable method for study of crowd dynamics in a complicated environment.

针对微观人群仿真中的战术决策问题，提出了两个子算法的路由算法。一个子算法在较高或宏观的层次上起作用，并用于确定出门，每当行人首次进入房间时，出门就会发生变化。该子算法基于定制的Dijkstra最短路径算法，引入了阻抗传导的概念，以考虑沿路径的拥塞。另一个子算法在较低或微观级别上起作用，并应与任何选定的微观人群动力学模型一起使用。它主要用于模拟行人在室内行走时出门的动态变化。引入了许多机制来考虑影响行人路线行为的实际因素，