一种新型的生物启发的群智能优化器 — — 不朽水母算法 (IJA)
The Immortal Jellyfish Algorithm (IJA) is a novel metaheuristic optimizer inspired by two natural phenomena:
Available in Python, C++, and Java.
…Key operators:
$$I_{i,s} = \frac{I_0}{1+\kappa|\mathbf{x}_i-\mathbf{g}_s|^2},e^{-\lambda\tau} \qquad \text{(Lighthouse Attraction)}$$
$$\mathbf{x}_i^{t+1} = \mathbf{x}_i^t + 0.01(u-l)\cdot L_j(\beta)\cdot(\mathbf{x}_i^t - \mathbf{x}^*) \qquad \text{(Lévy Exploration)}$$
$$\delta_j^t = A_0(1-\tau)^2\sin(2\pi f_p\tau+\phi_i)(u_j-l_j) \qquad \text{(Pulsed Swimming)}$$
Full derivations: docs/algorithm_details.md
Experiments: 30 independent runs, dimension D = 30.
IJA uses recommended settings; competitors use standard/published settings.
pip install -r requirements.txt
python - <<'EOF'
import sys; sys.path.insert(0, "python")
from ija import IJA
import numpy as np
result = IJA(n=100, max_iter=2000, seed=0).optimize(
lambda x: np.sum(x**2), dim=30, lb=-100.0, ub=100.0
)
print(f"Best fitness : {result.best_fitness:.6e}")
print(f"NFev : {result.n_function_evals}")
EOFMore examples: python python/examples/quickstart.py
cd cpp && mkdir build && cd build
cmake .. -DCMAKE_BUILD_TYPE=Release && make -j4
./ija_democd java && mvn compile
mvn exec:java -Dexec.mainClass="ija.Main"…| Parameter | Recommended | Description |
|---|---|---|
n |
100 | Population size |
max_iter |
2000 | Maximum iterations |
top_k |
5 | Lighthouse elites |
levy_beta |
1.5 | Lévy exponent |
archive_size |
20 | Elite archive capacity |
age_max |
20 | Stagnation threshold |
decay_lambda |
0.3 | Intensity decay rate |
alpha_max |
2.5 | Max step-size |
alpha_min |
0.01 | Min step-size |
@software{ija2025,
title = {Immortal Jellyfish Algorithm (IJA)},
author = {IJA Contributors},
year = {2025},
url = {https://github.com/LangZhong36/immortal-jellyfish-algorithm},
license = {MIT}
}Fork → feature branch → PR. All three language implementations should remain feature-equivalent.
MIT — see LICENSE.
暂无开放 Issues,或尚未同步最近议题。