Department of Mathematics, Faculty of Science, University of Hradec Králové, 500 03 Hradec Králové, Czech Republic.
Department of Applied Cybernetics, Faculty of Science, University of Hradec Králové, 500 03 Hradec Králové, Czech Republic.
Sensors (Basel). 2021 Jul 31;21(15):5214. doi: 10.3390/s21155214.
Numerous optimization problems designed in different branches of science and the real world must be solved using appropriate techniques. Population-based optimization algorithms are some of the most important and practical techniques for solving optimization problems. In this paper, a new optimization algorithm called the Cat and Mouse-Based Optimizer (CMBO) is presented that mimics the natural behavior between cats and mice. In the proposed CMBO, the movement of cats towards mice as well as the escape of mice towards havens is simulated. Mathematical modeling and formulation of the proposed CMBO for implementation on optimization problems are presented. The performance of the CMBO is evaluated on a standard set of objective functions of three different types including unimodal, high-dimensional multimodal, and fixed-dimensional multimodal. The results of optimization of objective functions show that the proposed CMBO has a good ability to solve various optimization problems. Moreover, the optimization results obtained from the CMBO are compared with the performance of nine other well-known algorithms including Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Gravitational Search Algorithm (GSA), Teaching-Learning-Based Optimization (TLBO), Grey Wolf Optimizer (GWO), Whale Optimization Algorithm (WOA), Marine Predators Algorithm (MPA), Tunicate Swarm Algorithm (TSA), and Teamwork Optimization Algorithm (TOA). The performance analysis of the proposed CMBO against the compared algorithms shows that CMBO is much more competitive than other algorithms by providing more suitable quasi-optimal solutions that are closer to the global optimal.
许多不同科学分支和现实世界中的优化问题都必须使用适当的技术来解决。基于种群的优化算法是解决优化问题的最重要和最实用的技术之一。本文提出了一种新的优化算法,称为基于猫鼠的优化器(CMBO),它模拟了猫和老鼠之间的自然行为。在提出的 CMBO 中,模拟了猫向老鼠的运动以及老鼠向避难所的逃避。提出了用于在优化问题上实现的 CMBO 的数学建模和公式化。在标准的三组目标函数上评估了 CMBO 的性能,包括单峰、高维多峰和固定维多峰。优化目标函数的结果表明,所提出的 CMBO 具有解决各种优化问题的良好能力。此外,将从 CMBO 获得的优化结果与包括遗传算法(GA)、粒子群优化(PSO)、引力搜索算法(GSA)、教学学习优化(TLBO)、灰狼优化器(GWO)、鲸鱼优化算法(WOA)、海洋捕食者算法(MPA)、被囊群算法(TSA)和团队优化算法(TOA)在内的其他九种知名算法的性能进行了比较。与比较算法相比,对提出的 CMBO 的性能分析表明,CMBO 通过提供更合适的准最优解,更接近全局最优,比其他算法更具竞争力。