Enhanced Black Widow Algorithm for Numerical Functions Optimization
Bibliographic record
Abstract
Black widow optimization algorithm is a recently evolutionary metaheuristic that imitates the unique mating behaviour of the black widow spiders in the real life. The trend of published papers utilizing the BWO algorithm is growing rapidly due to its efficiency in solving various engineering optimization problems. However, the BWO does not always perform as well as it should, and this is due to the random initialization of the spiders also the loss of good candidate solutions during the search. To remedy these problems, we propose in this paper a modified black widow optimization algorithm (MBWO) based on three ideas. First, an efficient initialization technique is adopted, which can guarantee starting the search with finest quality spiders and plays a significant role in determining an optimal or near-optimal solution. Second, the sexual cannibalism phase is modified to avoid the loss of high-quality solutions. Finally, an adaptive adjustment of crossover and mutation probabilities is presented to achieve a compromise between the diversification and intensification. Experiments are carried out on nineteen standard benchmark functions with different dimensions. The simulation results reveal that MBWO algorithm outperforms the original one also other metaheuristic algorithms in term of solution accuracy, global optimality, and the convergence speed.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".