nature_inspired_optimization_algorithms_comperative/
│
├── requirements.txt # Project dependencies
├── main_simulation.py # Entry point for the 1530 statistical runs
├── config.py # Global configurations (hyperparameters, FEs, bounds)
│
├── src/ # Source code directory
│ ├── __init__.py
│ │
│ ├── algorithms/ # Meta-heuristic algorithm implementations
│ │ ├── __init__.py
│ │ ├── base_optimizer.py # Abstract base class (OOP inheritance)
│ │ ├── pso.py # Particle Swarm Optimization
│ │ ├── de.py # Differential Evolution
│ │ ├── gwo.py # Grey Wolf Optimizer
│ │ ├── abc.py # Artificial Bee Colony
│ │ └── es.py # Evolution Strategies
│ │
│ ├── benchmarks/ # Mathematical test environments
│ │ ├── __init__.py
│ │ └── functions.py # Sphere, Rastrigin, Rosenbrock definitions
│ │
│ └── utils/ # Helper modules
│ ├── __init__.py
│ ├── logger.py # I/O operations (JSON/CSV data logging)
│ ├── statistics_engine.py # Binom Test, Mean, Median, Std calculations
│ └── visualizer.py # Convergence curves, boxplots, and 2D animations
│
│
└── outputs/ # Generated artifacts
├── figures/ # Static convergence and boxplot images
├── statistics/ # Output of 1530 runs
└── animations/ # 3D surface GIFs/MP4s from showcase runs
This repository contains a comprehensive comparative analysis of nature-inspired meta-heuristic optimization algorithms. The study evaluates performance, scalability, and statistical reliability across multi-dimensional benchmark functions.
The core objective is to rationalize the behavior of stochastic optimizers when facing the Curse of Dimensionality (
- ABC: Artificial Bee Colony
- DE: Differential Evolution
- ES: Evolution Strategies
- GWO: Grey Wolf Optimizer
- PSO: Particle Swarm Optimization
- Sphere: Unimodal, smooth convex function.
- Ackley: Multimodal, characterized by a large number of local minima.
- Zakharov: Plate-shaped, non-separable function with a flat surface.
To ensure computational efficiency, an Early Stopping mechanism is implemented. A run is considered a "Success" if the fitness value
The Success Rate represents the reliability of the algorithm over
To prove that results are not due to random chance, a Two-sided Binomial Test is applied to the Success Rate (SR). We test the deviation from a random baseline (
-
Null Hypothesis (
$H_0$ ): The algorithm performs no better/worse than random guessing ($p = 0.5$ ). -
Alternative Hypothesis (
$H_1$ ): The performance is significantly different from random ($p \neq 0.5$ ).
The Probability Mass Function (PMF) used for the exact test:
- Reliability Index: Color-coded p-values indicating the deterministic nature of success/failure. ├── algorithms/ # Meta-heuristic implementations ├── benchmarks/ # Mathematical test functions └── utils/ # Statistics engine & visualizer