Finally, which meta-heuristic algorithm is the best one? Online publication date: Mon, 13-Sep-2021
by Elham Shadkam; Samane Safari; Saba Saberi Abdollahzadeh
International Journal of Decision Sciences, Risk and Management (IJDSRM), Vol. 10, No. 1/2, 2021
Abstract: This paper is conducted to rank the six meta-heuristic algorithms such as the genetic, ant colony optimisation, tabu search, particle swarm optimisation, imperialist competitive, and simulated annealing algorithm and choose the most efficient algorithm among them, concerning collected information. Accordingly, three multi-criteria decision-making methods, including the analytical hierarchy process (AHP), TOPSIS, and AHP-TOPSIS methods are used. Criteria for comparing algorithms are selected based on the capability of each algorithm and the issues that are necessary to solve each problem. The result of the TOPSIS method indicates the superiority and efficiency of the tabu search algorithm. However, the analytical hierarchy process presents the ant colony algorithm as the best algorithm. Also, in the AHP-TOPSIS method, the best meta-heuristic algorithm is genetic. Finally, according to the results obtained from all three methods and the use of the combined compromise solution method (CoCoSo), the genetic algorithm is selected as the best algorithm.
Online publication date: Mon, 13-Sep-2021
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Decision Sciences, Risk and Management (IJDSRM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org