A parallel, ant-based algorithm for the Maximum Clique problem.
-
Updated
Sep 3, 2023 - C++
A parallel, ant-based algorithm for the Maximum Clique problem.
🐜 🧠 Solution for Travelling Salesman problem with the use of ant colony optimisation (ACO) algorithm.
Performance comparison of combinatorial optimization algorithms for the Travelling Salesman Problem (TSP).
Supporting code for GECCO's 2022 tutorial on Ant Colony Optimisation for Software Engineers
Computational Intelligence algorithm resources. Programming Language: Python 3.7 | IDE: Jupyter Notebook
A fast algorithm for solving the Graph Coloring problem and its generalizations (Bandwidth Coloring, Multi Coloring, and Bandwidth Multi Coloring problems)
ACO Ant System implementation
Add a description, image, and links to the ant-system topic page so that developers can more easily learn about it.
To associate your repository with the ant-system topic, visit your repo's landing page and select "manage topics."