Skip to content
#

metaheuristic-optimization

Here are 34 public repositories matching this topic...

k-Alternatives is a stochastic search algorithm designed to optimize combinatorial problems by exploring controlled deviations from a heuristic baseline. Originally designed for the Traveling Salesperson Problem (TSP), the architecture has been generalized to solve other optimization problems, such as the Knapsack Problem.

  • Updated Oct 3, 2026
  • JavaScript

Add this topic to your repo

To associate your repository with the metaheuristic-optimization topic, visit your repo's landing page and select "manage topics."

Learn more