Skip to main content
. 2020 Aug 29;50:101780. doi: 10.1016/j.ijdrr.2020.101780

Fig. 3.

Fig. 3

Comparison between the computational time of (a) heuristics, and (b) Procedure 1 (Greedy + Augmented Greedy + Min(K-Node Crossover) and Procedure 2 (Scheduling + Monte Carlo).