In comparison to its deterministic equivalents, simulation-driven meta-heuristic algorithms have proven effective in addressing a wide variety of issues. Despite this benefit, the stochastic nature of such algorithms results in a spectrum of answers after a certain number of trials, which may result in ambiguity about the quality of solutions. Therefore, it is critical to utilize an adequate method for evaluating the performance of a varied collection of meta-heuristic algorithms in order to make an informed judgment about the algorithms' supremacy and also to verify the claims made by researchers about their particular goals. Efficiency and effectiveness metrics may be used to evaluate the performance of a randomized meta-heuristic algorithm. The efficiency of an algorithm is related to the speed with which it finds correct solutions, converges, and computes. Effectiveness, on the other hand, refers to the algorithm's capacity for generating high-quality solutions. Both scopes are critical for solving continuous and discrete issues in single- or multi-objective settings. Each kind of issue has a unique formulation and measuring technique within the context of efficiency and effectiveness performance.
What is the best performing meta-heuristic optimization algorithm based on the mentioned measures?