Metaheuristic algorithms are widely used to find optimal or near-optimal solutions for complex problems by taking inspiration from natural behaviors and processes. Although many different methods have been developed, a common problem in many of them is maintaining a good balance between exploration and exploitation and avoiding local optima. To deal with this issue, this paper proposes a new method called the Blackcap Optimization Algorithm (BCOA), which is inspired by the navigation and migration behavior of Blackcap birds. Instead of using complicated distance calculations, the proposed method is based on angular movement vectors. The movement of each search agent is controlled by an angle-based mathematical model that combines the global best angle, a successful neighboring angle, and an adaptive exponential disturbance factor. In addition, the algorithm uses a quasi-genetic path transition mechanism to combine successful parent paths together, along with a territorial competition stage. This structure helps reduce computational cost and improves the balance between exploration and exploitation. The performance of the proposed algorithm is tested on 32 benchmark functions and seven engineering and network optimization problems. The simulation results show that BCOA has a good ability to avoid local optima and can achieve acceptable convergence speed and cost reduction compared to several existing methods.
Asghari et al. (Sat,) studied this question.