ArticleScientific reports2025
A new human-based offensive defensive optimization algorithm for solving optimization problems.
Article in Scientific reports, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 4 papers.
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
4 citing papers in PubMed.
- 3D UAV path optimization using a task-allocation and archive-guided mutation particle swarm optimization algorithm.Scientific reports · 2026Article
- Secant Optimization Algorithm for efficient global optimization.Scientific reports · 2026Article
- Multimodal breast cancer diagnosis using feature fusion and deep learning.Frontiers in medicine · 2026Article
- A novel meta-heuristic algorithm based on candidate cooperation and competition.Scientific reports · 2025Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
4 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
A novel human-inspired metaheuristic algorithm, termed Offensive Defensive Optimization, has been introduced to address single-objective optimization problems. This algorithm draws inspiration from the varied strategies utilized by players in board games, emulating and conceptualizing offensive and defensive behaviors within a hybrid search framework. The integration of mixed search behaviors facilitates a more efficient exploration and exploitation of the search space, thereby enhancing the algorithm's capability to surmount local minima. The algorithm was evaluated using the benchmark test suites from the Congress on Evolutionary Computation (CEC) 2017 and 2022, in addition to two real-world engineering design problems. In comparison to eight well-established metaheuristic algorithms, the proposed method demonstrated superior performance in 80% of the CEC2017 cases and 72% of the CEC2022 cases, with statistically significant improvements. The results further indicate that the proposed algorithm exhibits satisfactory convergence efficiency, along with robust exploration and exploitation capabilities, while maintaining a balanced equilibrium between these two processes. Additionally, the outcomes of the engineering design problems suggest that the proposed algorithm effectively manages optimization tasks, demonstrating clear superiority and enhanced competitiveness.
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.