Open AccessA new competitive multiverse optimization technique for solving single‐objective and multiobjective problems
Author(s) -
Benmessahel Ilyas,
Xie Kun,
Chellal Mouna
Publication year - 2020
Publication title -
engineering reports
Language(s) - English
Resource type - Journals
ISSN - 2577-8196
DOI - 10.1002/eng2.12124
Subject(s) - pairwise comparison , benchmark (surveying) , computer science , mathematical optimization , convergence (economics) , universe , optimization problem , multi objective optimization , population , competition (biology) , artificial intelligence , mathematics , ecology , physics , demography , geodesy , sociology , economic growth , astrophysics , economics , biology , geography
The development of useful algorithms for solving global optimization problems has recently drawing the research community's attention. A number of optimization algorithms have been suggested, which mimic a particular biological process or imitate natural evolution. In this work, a novel population‐based optimization technique is proposed, the so‐called competitive multiverse optimizer (CMVO) for solving global optimization problems. This novel method is fundamentally inspired by the multiverse optimizer algorithm (MVO) but with a different framework. Our basic idea is to inject a pairwise competitionmechanism between universes and adopts a novel update strategy that make universes learn from the winner. In CMVO, the mechanism of updating universes is not confined to the optimal universe but rather uses a bicompetitive scheme at each generation in which the universe that loses the competition learns from the winner, unlike in MVO in which all universes learn from the optimal universe. The main idea of this work is to raise the exploration rate for the search space by performing pairwise competition and improve the exploitation ability through learning from the winner. This work also presents a multi‐objective version of CMVO called MOCMVO with a simple structure to show the rapid convergence toward the Pareto front. The performance of our proposed method in single‐objective optimization is demonstrated on a large number of mathematical problems of standard benchmark. The results obtained confirm the superior overall performance of CMVO in terms of the quality of obtained solutions, computational efficiency, and convergence speed relative to many of the state‐of‐the‐art metaheuristic algorithms. In multiobjective optimization, the proposed MOCMVO is evaluated and compared to other multiobjective algorithms using 10 multiobjective benchmarks involving five unconstrained, three constrained, and two engineering design problems. The experimental results of the proposed method in multiobjective optimization demonstrate the competitiveness of the proposed method in term of quantitative and qualitative measures.