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

Table 7.

Results of the comparison of the algorithms on the real case study.

Algorithms Greedy Updated Greedy 2-N Crossover 3-N Crossover Scheduling Monte Carlo GA Clustering
Objectives 935 775 775 775 772 757 757 838
CPU times(s) 0.10 0.08 11.64 10.69 0.10 187.92 1800 7651