This article’s innovation and novelty are introducing a new metaheuristic method called mother optimization algorithm (MOA) that mimics the human interaction between a mother and her children. The real inspiration of MOA is to simulate the mother’s care of children in three phases education, advice, and upbringing. The mathematical model of MOA used in the search process and exploration is presented. The performance of MOA is assessed on a set of 52 benchmark functions, including unimodal and high-dimensional multimodal functions, fixed-dimensional multimodal functions, and the CEC 2017 test suite. The findings of optimizing unimodal functions indicate MOA’s high ability in local search and exploitation. The findings of optimization of high-dimensional multimodal functions indicate the high ability of MOA in global search and exploration. The findings of optimization of fixed-dimension multi-model functions and the CEC 2017 test suite show that MOA with a high ability to balance exploration and exploitation effectively supports the search process and can generate appropriate solutions for optimization problems. The outcomes quality obtained from MOA has been compared with the performance of 12 often-used metaheuristic algorithms. Upon analysis and comparison of the simulation results, it was found that the proposed MOA outperforms competing algorithms with superior and significantly more competitive performance. Precisely, the proposed MOA delivers better results in most objective functions. Furthermore, the application of MOA on four engineering design problems demonstrates the efficacy of the proposed approach in solving real-world optimization problems. The findings of the statistical analysis from the Wilcoxon signed-rank test show that MOA has a significant statistical superiority compared to the twelve well-known metaheuristic algorithms in managing the optimization problems studied in this paper.

No abstract

Institute of Mathematics of the Czech Academy of Sciences provides access to digitized documents strictly for personal use. Each copy of any part of this document must contain these Terms of use.

Institute of Mathematics of the Czech Academy of Sciences provides access to digitized documents strictly for personal use. Each copy of any part of this document must contain these Terms of use.

In the present paper a necessary condition for a cyclic extension of the rationals of prime degree l to have an integral normal basis generated by a unit is given. For a fixed l, this condition implies that there exists at most a finite number of such fields. A computational method for verifying the existence of an integral normal basis generated by a unit is given. For l = 5 l = 5 , all such fields are found.