BinDMO: a new Binary Dwarf Mongoose Optimization algorithm on based Z-shaped, U-shaped, and taper-shaped transfer functions for CEC-2017 benchmarks

Abstract

Intelligent swarm optimization algorithms have become increasingly common due to their success in solving real-world problems. Dwarf Mongoose Optimization (DMO) algorithm is a newly proposed intelligent swarm optimization algorithm in recent years. It was developed for continuous optimization problem solutions in its original paper. But real-world problems are not always problems that take continuously variable values. Real-world problems are often problems with discrete variables. Therefore, heuristic algorithms proposed for continuous optimization problems need to be updated to solve discrete optimization problems. In this study, DMO has been updated for binary optimization problems and the Binary DMO (BinDMO) algorithm has been proposed. In binary optimization, the search space consists of binary variable values. Transfer functions are often used in the conversion of continuous variable values to binary variable values. In this study, twelve different transfer functions were used (four Z-shaped, four U-shaped, and four Taper-shaped). Thus, twelve different BinDMO variations were obtained (BinDMO1, BinDMO2, …, BinDMO12). The achievements of BinDMO variations were tested on thirteen different unimodal and multimodal classical benchmark functions. The effectiveness of population sizes on the effectiveness of BinDMO was also investigated. When the results were examined, it was determined that the most successful BinDMO variation was BinDMO1 (with Z1-shaped transfer function). The most successful BinDMO variation was compared with three different binary heuristic algorithms selected from the literature (SO, PDO, and AFT) on CEC-2017 benchmark functions. According to the average results, BinDMO was the most successful binary heuristic algorithm. This has proven that BinDMO can be chosen as an alternative algorithm for binary optimization problems. © The Author(s) 2024.