A collection of Benchmark functions for numerical optimization problems
-
Updated
Sep 3, 2024 - Python
8000
A collection of Benchmark functions for numerical optimization problems
Python implementation of metaheuristic algorithms for the Travelling Salesman Problem (TSP), the Knapsack Problem (KP), Quadratic Function Minimization, and the CEC 2017 Benchmark Functions (https://github.com/tilleyd/cec2017-py/tree/master?tab=readme-ov-file)
Add a description, image, and links to the cec-2017 topic page so that developers can more easily learn about it.
To associate your repository with the cec-2017 topic, visit your repo's landing page and select "manage topics."