Memetic Algorithms with Explicit Diversity Management for the Linear Ordering Problem.
-
Updated
Jan 11, 2022 - C++
Memetic Algorithms with Explicit Diversity Management for the Linear Ordering Problem.
💼 Approach to the Quadratic Assignment Problem in C++ using memetic algorithms and tabu search.
C++ implementation of Memetic Algorithm
🧠 A set of metaheuristics applied in solving the QAP problem, including local search, genetic algorithms, memetics and more.
This project proposes an efficient memetic algorithm for the graph coloring problem. Authors : L. Moalic (laurent.moalic@uha.fr) and A. Gondran (alexandre.gondran@enac.fr). Details are presented in the paper "Variations on memetic algorithms for graph coloring problems" :
🌱 Genetic Algorithm, Memetic Algorithms, GRASP, Simulated Annealing, Multi start search, Reiterated Local Search, Local Search, Greedy and randomized Greedy
Add a description, image, and links to the memetic-algorithms topic page so that developers can more easily learn about it.
To associate your repository with the memetic-algorithms topic, visit your repo's landing page and select "manage topics."