Ocotillo Optimization Algorithm (OcOA)
In this paper, we propose the Ocotillo Optimization Algorithm (OcOA), a novel desert-inspired metaheuristic designed to solve complex optimization problems. Inspired by the adaptive strategies of desert plants, OcOA aims to achieve a balance between exploration and exploitation in high-dimensional and multimodal search spaces. The algorithm dynamically adjusts its behavior based on feedback from prior iterations, optimizing both search breadth and solution refinement. To evaluate its effectiveness, OcOA was tested against several well-known algorithms on a range of benchmark functions, including unimodal and multimodal functions from the CEC 2005 suite such as Sphere, Rosenbrock, Ackley, and Rastrigin. The results demonstrate that OcOA outperforms competing approaches in terms of accuracy, convergence speed, and computational efficiency. Additionally, its adaptability was validated through feature selection tasks, highlighting its robustness in handling both continuous and discrete optimization challenges. This study positions OcOA as a competitive optimization tool for various real-world applications