mincost
| Crates.io | mincost |
| lib.rs | mincost |
| version | 0.1.3 |
| source | src |
| created_at | 2021-06-23 07:04:10.548844 |
| updated_at | 2023-06-13 08:10:13.451989 |
| description | A collection of modern heuristic optimization toolkit |
| homepage | |
| repository | https://github.com/erihsu/mincost |
| max_upload_size | |
| id | 413814 |
| size | 30,625 |
Eric (erihsu)
documentation
README
MinCost
A collection of modern heuristic optimization toolkit.
Overwiew
-
Genetic Algorithm
-
Simulated Annealing
-
Particle Swarm
-
Tabu Search(TODO)
Features
-
Easy to embed
This is the primary design goal of mincost. See how to embed genetic algorithm into your Rust project, please refer to examples
-
Flexiable encoding style
In mincost, you can encode your solution with various style. ie, in i32, i16, i8 and even boolean.
-
Initialize solution by custom randness
The solution can be initialized by your custom randomization strategy by closure. Refer to examples
License
Licensed under either of these:
- Apache License, Version 2.0, (LICENSE-APACHE or https://www.apache.org/licenses/LICENSE-2.0)
- MIT license (LICENSE-MIT or https://opensource.org/licenses/MIT)
The project is in the early stage of construction, especially docs && examples.