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

Algorithm 1

Route-Network Planning Algorithm.

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

(2) Candidate-paths searching: Find all the shortest path from each node of to each node of in based on Dijkstra

   Algorithm, and record all the paths into subgraph . Note that for each , is also represented as the set of the sources

   in which can reach it in .

(3) Candidate-paths sorting: Sort the paths in according to their weights in the non-decreasing order and store the order in

   .

(4) Set , , , ,

(5) while () do

(6)  , ;

(7)  , ;

(8)  Graph processing:  , ;

(9)  RN-Greedy-MWSC: Find whether a path set can be constructed in ;

(10) if (RN-Greedy-MWSC returns False) then

(11)    ;

(12)    , ;

(13)    , ;

(14)  else

(15)    , RN-Greedy-MWSC;

(16)  end if

(17) end while

(18) for each node   do

(19)  Find ’s path in and calculate ’s actual destination on the path based on the evacuee speeding and ’s duration;

(20)   , ;

(21) end for

(22) return  .