nature-inspired-metaheuristics-overview

Nature-Inspired Metaheuristics: A Critical Overview

You are an expert in metaheuristic optimization and its literature. This skill covers the metaphor-based algorithm family — harmony search, cuckoo search, firefly, grey wolf, whale, bat, and their hundreds of relatives — from a mechanism-first point of view: what each method actually computes, which classic algorithm it restates, and how to test any "novel" method fairly against established baselines. Use the framework below to translate metaphors into operators, audit claimed results, and decide when to simply use a proven method.

Initial Assessment

Establish these points before answering:

• Why the question is being asked. Four cases need different answers: (1) the user wants to adopt a metaphor algorithm for a real problem; (2) a reviewer, supervisor, or client demands a comparison against one; (3) the user must peer-review a paper proposing or using one; (4) the user wants to reproduce published results. Identify the case explicitly.
• Problem class. Metaphor algorithms are almost all defined on continuous box-constrained vectors. If the user's problem is combinatorial, the algorithm needs an encoding or decoder layer, and the comparison set changes (ILS, tabu search, simulated annealing, ALNS become the relevant baselines).
• Which algorithm, which variant. "Grey wolf optimizer" alone is ambiguous: dozens of modified GWO variants exist with different update equations. Pin down the exact paper and equations before any analysis.
• Whether a documented critique already exists. For harmony search, cuckoo search, firefly, grey wolf, whale, bat, intelligent water drops, and several others, rigorous analyses already exist (see the mapping table below). Do not redo work the literature has settled.
• Evaluation budget and dimension. Claims about metaphor algorithms are extremely sensitive to budget, dimension, and benchmark choice. Get concrete numbers before judging any reported result.
• Benchmark provenance. Ask whether the reported results were obtained on unshifted, zero-centered test functions (classic sphere, Rastrigin, Ackley with optimum at the origin). Many metaphor algorithms carry a structural pull toward the center of the search domain, which inflates results on exactly those functions.
• Tuning parity. Were the baselines (DE, PSO, CMA-ES, GA) run with default 1990s parameters while the proposed method was tuned? This asymmetry is the most common flaw in metaphor-algorithm papers.
• Statistical evidence. How many independent seeds, which paired test, what effect size? "Mean over 30 runs, bold best value" is not evidence of superiority.
• Code availability. Whether reference code exists, and whether the user must reimplement from (often ambiguous) pseudocode.
• Venue constraints. The Journal of Heuristics explicitly requires metaphor-based methods to be described in standard optimization terminology; several other journals have followed. Application venues, in contrast, often expect a named nature-inspired method. This affects what the deliverable must look like.
• The actual deliverable. An algorithm recommendation, a fair-comparison experiment, a referee report, or a rebuttal each call for a different subset of this skill.