Clonal Selection Algorithms

On this page, you will find a collection of practical examples that demonstrate how to use the Clonal Selection Algorithms classes implemented in our package.

Run notebooks online via Binder:

---

Clonalg (Clonal Selection Algorithm)

• Traveling Salesman Problem

In this notebook, apply Clonalg to the Knapsack Problem using optimization algorithms from the AISP package.

• Rastrigin Function

In this notebook, we apply Clonalg to the Rastrigin Function, a classic continuous optimization problem using optimization algorithms from the AISP package.

• Knapsack Problem

In this notebook, apply Clonalg to the Knapsack Problem using optimization algorithms from the AISP package.

---