Multiobjective Route Planning Model and Algorithm for Emergency Management

Pseudocode 1

Pseudocode for the static heuristic algorithm.

(1) Initialization (cycles counter NC = 0). Let , , , set the value of fundamental parameters of

  the heuristic algorithm including the maximum number of cycles NC_max, the satisfaction level of travel time and safety

  probability through the selected route , , growth rate of weighting coefficient where , , .

(2) Construct a new network , where : , ) and .

(3) , , let be the weight on arc (, ), , use Dijkstra algorithm to obtain the shortest route

  with respect to and obtain the corresponding optimal value . According to Lemma 2, .

 (3.1) If , has no solution, the algorithm terminates.

 (3.2) Else if , , , , go to step 5.

(4) , , let be the weight on arc (, ), , use Dijkstra algorithm to obtain the shortest route

  with respect to and obtain the corresponding optimal value . According to Lemma 2, .

 (4.1) Else if , , , , go to step 5.

 (4.2) Else , , , , .

  (4.2.1) If NC ≤ NC_max, , , use

      the algorithm to obtain the shortest route with respect to .

   (4.2.1.1) If , , NC = NC + 1, go to step 4.2.1.

   (4.2.1.2) Else if , , , , go to step 5.

   (4.2.1.3) Else, , NC = NC + 1, , , , go to step 4.2.1.

(5) If , is the optimal solution selected and (, ) is the corresponding vector of weighting coefficients,

  the algorithm terminates.

(6) Else, has no solution, the algorithm terminates.