ArticleBiomimetics (Basel, Switzerland)2026
Blackcap Optimization Algorithm (BCOA): A Novel Metaheuristic Algorithm for Global and Engineering Optimization Problems.
Article in Biomimetics (Basel, Switzerland), 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
2 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
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.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.