Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/m-decoster/RsGenetic
Genetic Algorithm library in Rust
https://github.com/m-decoster/RsGenetic
rust
Last synced: 24 days ago
JSON representation
Genetic Algorithm library in Rust
- Host: GitHub
- URL: https://github.com/m-decoster/RsGenetic
- Owner: m-decoster
- License: apache-2.0
- Created: 2015-12-12T10:07:07.000Z (over 8 years ago)
- Default Branch: master
- Last Pushed: 2021-01-22T07:58:54.000Z (over 3 years ago)
- Last Synced: 2024-03-25T21:12:06.367Z (about 2 months ago)
- Topics: rust
- Language: Rust
- Size: 3.7 MB
- Stars: 76
- Watchers: 7
- Forks: 19
- Open Issues: 4
-
Metadata Files:
- Readme: README.md
- License: LICENSE-APACHE
Lists
- awesome-rust - m-decoster/RsGenetic
- awesome-rust-zh - m-decoster/RsGenetic - Rust 中的遗传算法库。在维护模式下。 (库 / 人工智能)
- awesome-rust - m-decoster/RsGenetic
- awesome-rust - m-decoster/RsGenetic
- awesome-rust-cn - m-decoster/RsGenetic
- awesome-rust-zh-cn - m-decoster/RsGenetic
- awesome-rust - m-decoster/RsGenetic
- awesome-rust-cn - m-decoster/RsGenetic
- awesome-rust - m-decoster/RsGenetic
README
# RsGenetic
[](https://rust-reportcard.xuri.me/report/github.com/m-decoster/RsGenetic)
[](https://travis-ci.org/m-decoster/RsGenetic)
[](https://crates.io/crates/rsgenetic/)
[](./LICENSE)
[](./LICENSE)
## Summary and Features
RsGenetic is a framework for executing genetic algorithms in Rust. It is designed to have a simple but modular API.
## Examples and Documentation
Documentation is available [here](https://docs.rs/rsgenetic).
### Implementing the `Fitness` trait
Note that, if your fitness type is an integer type, you
do not need to write a wrapper struct around this integer. See
the `types` module documentation for more details.
```rust
use rsgenetic::pheno::*;
use std::cmp::Ordering;
#[derive(Eq, PartialEq, PartialOrd, Ord)]
struct MyFitness {
value: i32,
}
impl Fitness for MyFitness {
// The zero value for our custom type
fn zero() -> MyFitness {
MyFitness { value: 0 }
}
// The absolute difference between two instances
fn abs_diff(&self, other: &MyFitness) -> MyFitness {
MyFitness {
value: (self.value - other.value).abs()
}
}
}
```
### Implementing the `Phenotype` trait
Note that we use an integer type as the fitness type parameter
to make this example more simple. Replace it with your custom type
if needed. In this example, we try to find individuals with
two integer components that sum to a target value.
This example is far-fetched, but simplified to show how
easy it is to define new individuals and implement
the `Phenotype` trait.
```rust
use rsgenetic::pheno::*;
const TARGET: i32 = 100;
#[derive(Copy, Clone)]
struct MyPheno {
x: i32,
y: i32,
}
impl Phenotype for MyPheno {
// How fit is this individual?
fn fitness(&self) -> i32 {
TARGET - (self.x + self.y)
}
// Have two individuals create a new individual
fn crossover(&self, other: &MyPheno) -> MyPheno {
MyPheno {
x: self.x,
y: other.y,
}
}
// Mutate an individual, changing its state
fn mutate(&self) -> MyPheno {
MyPheno {
x: self.x + 1,
y: self.y - 1,
}
}
}
```
### Creating and running a `Simulator`
```rust
use rsgenetic::pheno::*;
use rsgenetic::sim::*;
use rsgenetic::sim::seq::Simulator;
use rsgenetic::sim::select::*;
const TARGET: i32 = 100;
#[derive(Copy, Clone)]
struct MyPheno {
x: i32,
y: i32,
}
impl Phenotype for MyPheno {
// How fit is this individual?
fn fitness(&self) -> i32 {
TARGET - (self.x + self.y)
}
// Have two individuals create a new individual
fn crossover(&self, other: &MyPheno) -> MyPheno {
MyPheno {
x: self.x,
y: other.y,
}
}
// Mutate an individual, changing its state
fn mutate(&self) -> MyPheno {
MyPheno {
x: self.x + 1,
y: self.y - 1,
}
}
}
fn main() {
let mut population = (0..100).map(|i| MyPheno { x: i, y: 100 - i }).collect();
let mut s = Simulator::builder(&mut population)
.set_selector(Box::new(StochasticSelector::new(10)))
.set_max_iters(50)
.build();
s.run();
let result = s.get().unwrap(); // The best individual
}
```
See the `examples` directory in the repository for more elaborate examples.
## Note
This library is currently in maintenance mode. There have been some indications that the API
needs an update to be more flexible, which would require an incrementation of the major version number (#23, #30).
Unfortunately, I currently do not have the time to implement such a redesign. I will however continue to reply to issues
and merge pull requests, but features might not be implemented by me, depending on their size.
## License
Licensed under either of
* Apache License, Version 2.0 ([LICENSE-APACHE](LICENSE-APACHE) or http://www.apache.org/licenses/LICENSE-2.0)
* MIT license ([LICENSE-MIT](LICENSE-MIT) or http://opensource.org/licenses/MIT)
at your option.
### Contribution
Contributions are always welcome. Take a look at the issues for any enhancements that need to be
done or bugs that need to be fixed. If you encounter any bugs while using the library, feel free to
open an issue and/or fix the bug, and submit pull requests.
Unless you explicitly state otherwise, any contribution intentionally submitted
for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any
additional terms or conditions.