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.
Numerical optimization in pure Rust
License: MIT OR Apache-2.0
Last Commit: 2025-11-07
Last Published: 2025-09-28
COBYLA optimizer for Rust
License: non-standard
Last Commit: 2026-08-24
Last Published: 2026-08-24
SLSQP optimizer for Rust
License: non-standard
Last Commit: 2026-08-24
Last Published: 2026-08-24
A library for efficient global optimization
License: Apache-2.0
Last Commit: 2026-08-31
Last Published: 2026-08-31
simplers_optimization
[
crate ·
repo ·
docs
]
A Rust implementation of the Simple(x) black-box optimization algorithm.
License: Apache-2.0
Last Commit: 2026-05-12
Last Published: 2026-05-12
Find approximate solutions to your optimisation problem using metaheuristics algorithms
License: GPL-3.0
Last Commit: 2022-07-16
Last Published: 2022-07-16
rsgenetic
[
crate ·
repo ·
docs
]
archived
A library providing genetic algorithm execution.
License: MIT/Apache-2.0
Last Commit: 2021-01-22
Last Published: 2021-01-21
Fast, parallel, extensible and adaptable genetic algorithm library.
License: MPL-2.0
Last Commit: 2021-07-11
Last Published: 2021-02-28
Evolutionary algorithms library written in Rust.
License: MIT
Last Commit: 2022-07-11
Last Published: 2017-06-26
Rust implementation of real-coded genetic algorithm for solving optimization problems and training of neural networks. The latter is also known as neuroevolution.
License: GPL-3.0
Last Commit: 2017-08-20
Last Published: 2017-08-20
pengowen123/eant2
[
repo
]
License: GPL-3.0
Last Commit: 2022-06-12
Evolutionary Algorithm Library for Rust
License: MIT
Last Commit: 2016-01-19
Last Published: 2015-12-11