A framework for single/multi-objective optimization with metaheuristics

Intelligently optimizes technical indicators and optionally selects the least intercorrelated for use in machine learning models

Evolutionary & genetic algorithms for Julia

[ICML 2020] PyTorch Code for "Efficient Continuous Pareto Exploration in Multi-Task Learning"

Spatial Containers, Pareto Fronts, and Pareto Archives

A very fast, 90% vectorized, NSGA-II algorithm in matlab.

OptFrame - Optimization Framework

pfevaluator: A library for evaluating performance metrics of Pareto fronts in multiple/many objective optimization problems

Genetic Algorithm (GA) for a Multi-objective Optimization Problem (MOP)

An R package for multi/many-objective optimization with non-dominated genetic algorithms' family

This repo contains the underlying code for all the experiments from the paper: "Automatic Discovery of Privacy-Utility Pareto Fronts"

Multi-Objective PSO (MOPSO) in MATLAB

Minimal Policy Search Toolbox

Non-dominated Sorting Genetic Algorithm II (NSGA-II) in MATLAB

NSGA-III: Non-dominated Sorting Genetic Algorithm, the Third Version — MATLAB Implementation

(Code) Multi-objective Sparrow Search Optimization for Task Scheduling in Fog-Cloud-Blockchain Systems

A tutorial for the famous non dominated sorting genetic algorithm II, multiobjective evolutionary algorithm.

A set of ant colony system and max-min ant system based algorithms for the single-objective MinMax Multiple Traveling Salesman Problem (mTSP) and for the bi-objective mTSP

Python bindings for OptFrame C++ Functional Core

This repository contains source code for the four investigated ACO algoritms for the bi-objective Multiple Traveling Salesman Problem. For more details, see this paper "Necula, R., Breaban, M., Raschip, M.: Tackling the Bi-criteria Facet of Multiple Traveling Salesman Problem with Ant Colony Systems. ICTAI, (2015)" (https://ieeexplore.ieee.org/d…