Metaheuristics aim to generate or select a heuristic for an optimization problem,
particularly where the set of sample solutions is too large to completely sample.
A handful of metaheuristic crates exists in the Rust ecosystem, most notably
several libraries that make it straight-forward to write genetic or evolutionary algorithms.
Mathematical optimization in pure Rust
Last Commit: 2023-11-09
Last Published: 2023-02-20
COBYLA optimizer for Rust
Last Commit: 2023-10-25
Last Published: 2023-10-19
SLSQP optimizer for Rust
Last Commit: 2023-10-25
Last Published: 2023-10-19
Flexible and modular single or multi-objective solver for contiguous and discrete problems
Last Commit: 2023-11-28
Last Published: 2020-08-16
simplers_optimization
[
crate ·
repo ·
docs
]
A Rust implementation of the Simple(x) black-box optimization algorithm.
Last Commit: 2023-04-24
Last Published: 2021-10-24
A toolbox for efficient global optimization
Last Commit: 2023-11-30
Last Published: 2023-11-30
Find approximate solutions to your optimisation problem using metaheuristics algorithms
Last Commit: 2022-07-16
Last Published: 2022-07-16
A library providing genetic algorithm execution.
Last Commit: 2021-01-22
Last Published: 2021-01-21
Fast, parallel, extensible and adaptable genetic algorithm library.
Last Commit: 2021-07-11
Last Published: 2021-02-28
Rust implementation of real-coded genetic algorithm for solving optimization problems and training of neural networks. The latter is also known as neuroevolution.
Last Commit: 2017-08-20
Last Published: 2017-08-20
a little lib to use genetic algorithm
Last Published: 2015-12-11
Evolutionary algorithms library written in Rust.
Last Commit: 2022-07-11
Last Published: 2017-06-26
Evolutionary Algorithm Library for Rust
Last Commit: 2016-01-19
Last Published: 2015-12-11