Optimization is essential in various fields such as finance, transportation, energy, and health care. However, solving real optimization problems, especially nondeterministic polynomial, requires considerable computational resources. Metaheuristics provide fast and cost-effective solutions to these problems. In this paper, eight state-of-the-art nature-inspired metaheuristic algorithms that have demonstrated excellent performance are compared in detail. In addition, a novel tournament procedure has been proposed to produce a quality ranking of selected metaheuristic algorithms, which are compared based on their optimization results, even if they were not originally tested with the same set of test functions, but only partially. The selected algorithms are evaluated using thirty-two test functions, which is a representative sample size. The evaluation also showed that while one algorithm produced the best overall results, this does not mean that this algorithm is the best for solving each function. This also highlights the need for further research in metaheuristic algorithms.