Expand description
Problem definitions and built-in benchmark/problem implementations.
The central abstraction is Problem, which defines how to:
- create random candidate solutions,
- evaluate quality/fitness,
- compare fitness according to problem-owned semantics,
- render domain-specific solution summaries for observers,
- optionally expose bounds metadata for real-valued solutions.
Structs§
- Ackley
Problem - Ackley: a classic continuous minimization benchmark.
- Knapsack
Builder - Knapsack
Problem - Knapsack Problem: maximize the value of items in a knapsack without exceeding capacity
- QapProblem
- Quadratic Assignment Problem (QAP).
- Rastrigin
Problem - Rastrigin: a classic multimodal continuous minimization benchmark.
- TspProblem
- Traveling Salesman Problem (TSP) with explicit distance matrix.
- ZDT1
Problem - ZDT1: A classic bi-objective test problem
Traits§
- Problem
- Trait that defines the basic interface for optimization problems.
Functions§
- build_
knapsack_ from_ records - Builds a
KnapsackProblemfrom generic record maps. - build_
tsp_ from_ records - Builds a
TspProblemfrom edge-like records.