- Article
Swarm-intelligence optimizers are frequently introduced through new metaphors while remaining orders of magnitude behind differential evolution (DE) methods on standard benchmarks. This work asks whether a swarm optimizer can reach the boundary of the DE tier by taking its metaphor beyond itself: every operator justified by function and validated by one-factor-out ablation. The resulting algorithm, ANEMMSO, combines a three-leader hierarchy with inertial momentum, unified greedy selection, a current-to-pbest precision operator with success-history adaptation, population size reduction, and an operator schedule latched at diversity collapse; the schedule can also be learned during the run itself, with no pre-training and no external data. On the official CEC2017 evaluator (28 functions, four dimensions, 30 independent runs, sixteen comparators including four CEC competition winners), no swarm method in the panel, nor the genetic algorithm, outperforms ANEMMSO under the Holm procedure. On unimodal functions, it matches the accuracy of the best method of the panel, with a median error ratio of 1.00 at three of the four dimensions, and it improves on its canonical hierarchical formulation by 1.85 orders of magnitude on hybrid functions. The five DE methods remain ahead, with NL-SHADE-RSP the closest by a small effect size; composition functions at high dimension remain a documented limitation. An attribution analysis explains the hybrid’s behavior: on hybrid functions, the swarm move contributes three quarters of the descent while executing about six percent of the moves, so the hybrid is not reducible to its DE component. These results establish that a swarm optimizer taken beyond its metaphor, with every operator functionally justified, can reach the DE frontier.
19 November 2026





