Research Article
Dynamic Sign Guidance Optimization for Crowd Evacuation considering Flow Equilibrium
Algorithm 5 Algorithm for lower-level model.
(1) | Input: the current simulation time interval , sign direction variable , pedestrian number in grids , | (2) | Output: the exit/route choice result for individuals in each grid | (3) | Procedure ROUTECHOICE(, , ) | (4) | initialize the convergence accuracy | (5) | while do not satisfy the convergence condition, do | (6) | For all each grid , do | (7) | calculate according to equation (13) based on . | (8) | For all each grid , do | (9) | calculate the according to () and equations (15)–(20). | (10) | End for | (11) | End for | (12) | Find shortest path and calculate the shortest travel time | (13) | For all each grid , do | (14) | Calculate the travel time and () according to equations (12) and (19), respectively | (15) | Calculate the queue length and estimate the evacuation travel time according to equations (20) and (11), respectively. | (16) | End for | (17) | For all OD pairs , do | (18) | For all , do | (19) | calculate the minimum evacuation time and its corresponding grids set according to equation (24), where | (20) | End for | (21) | Calculate , where denotes pedestrian sensitivities to the evacuation travel time differences | (22) | For all , do | (23) | If | (24) | Then set Else set | (25) | End if | (26) | End for | (27) | End for | (28) | End while | (29) | End procedure |
|