Simple and reliable optimization with local, global, population-based and sequential techniques in numerical discrete search spaces.
-
Updated
Mar 10, 2025 - Python
Simple and reliable optimization with local, global, population-based and sequential techniques in numerical discrete search spaces.
🐦 Opytimizer is a Python library consisting of meta-heuristic optimization algorithms.
A Python implementation of the Ant Colony Optimization Meta-Heuristic
Heuristic Optimization for Python
A Hyper-Heuristic framework
Exact and meta-heuristic algorithms for NP problems
Black Widow Optimization implemented in pure Python.
📄 Official implementation regarding the paper "Creating Classifier Ensembles through Meta-heuristic Algorithms for Aerial Scene Classification".
🐝 Nature-Inspired Optimization Applied to Deep Learning for ICMC/USP mini-course.
Currently a prototype implementation of Pareto local search algorithm in preparation for an upcoming project
📄 Official implementation regarding the paper "A Survey on Metaheuristic Approaches to Feature Selection".
DVFS framework addressing the problem of performance-energy trade-off, 2023.
📄 Official implementation regarding the paper "Improving Pre-Trained Weights Through Meta-Heuristic Fine-Tuning".
📄 Official implementation regarding the paper "Adapting Convolutional Restricted Boltzmann Machines Through Evolutionary Optimization".
Particle Swarm Optimization OOP implementation
📄 Official implementation regarding the paper "Enhancing Restricted Boltzmann Machines Reconstructability Through Meta-Heuristic Optimization".
Harmony Search algorithm implemented in python with object oriented programming.
Implementation of the PAMELI algorithm for computationally expensive multi-objective optimization
Add a description, image, and links to the meta-heuristic topic page so that developers can more easily learn about it.
To associate your repository with the meta-heuristic topic, visit your repo's landing page and select "manage topics."