Ranking and comparing evolutionary algorithms with Hellinger-TOPSIS》.pdf

Applied Soft Computing 37 (2015) 217–226 Contents lists available at ScienceDirect Applied Soft Computing j o u r na l h o me p ag e: w w w. elsev /locate/aso c Ranking and comparing evolutionary algorithms with Hellinger-TOPSIS Renato A. Krohling a,b,∗ , Rodolfo Lourenzutti b , Mauro Campos b a Production Engineering Department, PPGI UFES, Federal University of Espirito Santo, Av. Fernando Ferrari 514, CEP 29060-270 Vitória, ES, Brazil b Graduate Program in Computer Science, PPGI UFES, Federal University of Espirito Santo, Av. Fernando Ferrari 514, CEP 29060-270 Vitória, ES, Brazil a r t i c l e i n f o a b s t r a c t Article history: When multiple algorithms are applied to multiple benchmarks as it is common in evolutionary compu- Received 18 January 2015 tation, a typical issue rises, how can we rank the algorithms? It is a common practice in evolutionary Received in revised form 28 July 2015 computation to execute the algorithms several times and then the mean value and the standard devia- Accepted 3 August 2015 tion are calculated. In order to compare the algorithms performance it is very common to use statistical Available online 14 August 2015 hypothesis tests. In this paper, we propose a novel alternative method based on the Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) to support the performance comparisons. In this case, Keywords: the alternatives are the algorithms and the criteria are the benchmarks. Since the standard T