13 October 2020 3 6K Report

I am solving an NP-Hard combinatorial optimization problem. I have developed two meta-heuristics to solve this problem. I am getting almost similar results using both the algorithms. I want to compare the performance of these two algorithms using some statistical tests.

I have applied each algorithm 30 times to an instance of the problem, and I have recorded the best-found objective function value for each experiment. Therefore, for each instance of the problem, I have two sets of 30 best-found solutions obtained using the two algorithms.

It would be nice if someone can suggest me the best statistical test that I can apply.

Thanks in advance.

More Soumen Atta's questions See All
Similar questions and discussions