Binary multi-verse optimization algorithm for global optimization and discrete problems

Nailah Al-Madi, Hossam Faris, Seyedali Mirjalili

Research output: Contribution to journalArticlepeer-review

59 Citations (Scopus)


Multi-verse optimizer is one of the recently proposed nature-inspired algorithms that has proven its efficiency in solving challenging optimization problems. The original version of Multi-verse optimizer is able to solve problems with continuous variables. This paper proposes a binary version of this algorithm to solve problems with discrete variables such as feature selection. The proposed Binary Multi-verse optimizer is equipped with a V-shaped transfer function to covert continuous values to binary, and update the solutions over the course of optimization. A comparative study is conducted to compare Binary Multi-verse optimizer with other binary optimization algorithms such as Binary Bat Algorithm, Binary Particle Swarm Optimization, Binary Dragon Algorithm, and Binary Grey Wolf Optimizer. As case studies, a set of 13 benchmark functions including unimodal and multimodal is employed. In addition, the number of variables of these test functions are changed (5, 10, and 20) to test the proposed algorithm on problems with different number of parameters. The quantitative results show that the proposed algorithm significantly outperforms others on the majority of benchmark functions. Convergence curves qualitatively show that for some functions, proposed algorithm finds the best result at early iterations. To demonstrate the applicability of proposed algorithm, the paper considers solving feature selection and knapsack problems as challenging real-world problems in data mining. Experimental results using seven datasets for feature selection problem show that proposed algorithm tends to provide better accuracy and requires less number of features compared to other algorithms on most of the datasets. For knapsack problem 17 benchmark datasets were used, and the results show that the proposed algorithm achieved higher profit and lower error compared to other algorithms.

Original languageEnglish
Pages (from-to)3445-3465
Number of pages21
JournalInternational Journal of Machine Learning and Cybernetics
Issue number12
Publication statusPublished - 1 Dec 2019
Externally publishedYes


  • Feature selection
  • Global optimization
  • Multi-verse optimization algorithm
  • Optimization


Dive into the research topics of 'Binary multi-verse optimization algorithm for global optimization and discrete problems'. Together they form a unique fingerprint.

Cite this