Exact methods for solving the The Minimum-Cost Bounded-Error Calibration Tree problem
-
Updated
Aug 22, 2020 - C++
Exact methods for solving the The Minimum-Cost Bounded-Error Calibration Tree problem
multi-objective optimization via differential evolution and non-dominated sorting
TER visant à l'optimisation du placement de routes sur une surface, en maximisant les zones exploitables et leur accessibilité.
NSGA-III algorithm modification with elitism in environment selection
An MPI and OpenMP parallelized version of the original NSGAII code.
A genetic algorithms library in C++ for single- and multi-objective optimization.
Official public repository for the XtalOpt crystallographic multi-objective evolutionary algorithm
OptFrame - C++17 (and C++20) Optimization Framework in Single or Multi-Objective. Supports classic metaheuristics and hyperheuristics: Genetic Algorithm, Simulated Annealing, Tabu Search, Iterated Local Search, Variable Neighborhood Search, NSGA-II, Genetic Programming etc. Examples for Traveling Salesman, Vehicle Routing, Knapsack Problem, etc.
A C++ platform to perform parallel computations of optimisation tasks (global and local) via the asynchronous generalized island model.
Add a description, image, and links to the multi-objective-optimization topic page so that developers can more easily learn about it.
To associate your repository with the multi-objective-optimization topic, visit your repo's landing page and select "manage topics."