Multi-objective boxing match algorithm for multi-objective optimization problems

In the last two decades, due to having fast computation after inventing computers and also considering real-world optimization problems, research on developing new algorithms for problem having more than one objective have been one of the appealing and attractive topics both for academia and industrial practitioners. By this motivation, we introduce a Multi-Objective Boxing Match Algorithm (MOBMA) in this paper. The proposed algorithm studies the multi-objective version of the Boxing Match Algorithm (BMA) by incorporating a unique search strategy and new solutions-producing mechanism, enhancing the algorithm's capability for exploration and exploitation phases. Besides, its performance is analyzed with famous and capable multi-objective metaheuristics. We consider ten multi-objective benchmarks and three classical engineering problems. Statistical analyses are also conducted on the benchmark test functions from three engineering design problems. This study shows the superior performance of the proposed algorithm, considering both quantitative and qualitative analyses.