Novel metaheuristic based on multiverse theory for optimization problems in emerging systems
MetadataShow full item record
AbstractFinding an optimal solution for emerging cyber physical systems (CPS) for better efficiency and robustness is one of the major issues. Meta-heuristic is emerging as a promising field of study for solving various optimization problems applicable to different CPS systems. In this paper, we propose a new meta-heuristic algorithm based on Multiverse Theory, named MVA, that can solve NP-hard optimization problems such as non-linear and multi-level programming problems as well as applied optimization problems for CPS systems. MVA algorithm inspires the creation of the next population to be very close to the solution of initial population, which mimics the nature of parallel worlds in multiverse theory. Additionally, MVA distributes the solutions in the feasible region similarly to the nature of big bangs. To illustrate the effectiveness of the proposed algorithm, a set of test problems is implemented and measured in terms of feasibility, efficiency of their solutions and the number of iterations taken in finding the optimum solution. Numerical results obtained from extensive simulations have shown that the proposed algorithm outperforms the state-of-the-art approaches while solving the optimization problems with large feasible regions.
CitationHosseini, E., Ghafoor, K.Z., Emrouznejad, A., Sadiq, A.S. and Rawat, D.B. (2021) Novel metaheuristic based on multiverse theory for optimization problems in emerging systems, Applied Intelligence. 51, pp. 3275–3292. https://doi.org/10.1007/s10489-020-01920-z
DescriptionThis is an accepted manuscript of an article published by Springer in Applied Intelligence on 11/11/2020, available online at: https://doi.org/10.1007/s10489-020-01920-z The accepted version of the publication may differ from the final published version.
Except where otherwise noted, this item's license is described as https://creativecommons.org/licenses/by-nc-nd/4.0/