Comparison of evolutionary algorithms implemented in different programming languages

The performance of the evolutionary algorithms is assessed by comparing them with the existing algorithms. Comparison of the evolutionary algorithms in the literature plays a key role as it illustrates which algorithms are better. It is a common practice to simply take the results from the papers of the algorithms you are comparing your proposed algorithm to. However, it is not guaranteed that the experiments are performed in accordance with the guidelines for a fair comparison. Since a correct execution of an experiment is crucial to be able to state with a certainty the superiority of evolutionary algorithms, it is recommended that the experiment is repeated. This, however, can be a challenge if the source code of the algorithm is not available or it needs to be implemented in another programming language. Such approach can lead to misleading results due to the unintentional mistakes made in implementing the algorithm. Another factor that is often overlooked are the differences between the programming languages in which the algorithm is implemented. The problem is highlighted by analyzing and comparing the performance of the GWO algorithm implemented in six programming languages.