Dynamic Route Network Planning Problem for Emergency Evacuation in Restricted-Space Scenarios

Algorithm 2

Function: RN-Greedy-MWSC Algorithm.

(1) Construct a route network from to .  in:  out:

(2) Set , .

(3) for each   do

(4) Use its redundant utilization as its weight, , where

    is the threshold of the traveling-person number for an exit.

(5) end for

(6) Set , , .

(7) while () do

(8)  Select the with the minimum average redundant utilization ratio, ;

(9)   if () then

(10)    The first nearest nodes in

(11)  end if

(12)   , , , .

(13) end while

(14) if () then

(15)   return False;

(16) else

(17)  return  ;

(18) end if