mincost 0.1.3

A collection of modern heuristic optimization toolkit
Documentation
  • Coverage
  • 40.91%
    9 out of 22 items documented0 out of 0 items with examples
  • Size
  • Source code size: 30.93 kB This is the summed size of all the files inside the crates.io package for this release.
  • Documentation size: 3.87 MB This is the summed size of all files generated by rustdoc for all configured targets
  • Ø build duration
  • this release: 10s Average build duration of successful builds.
  • all releases: 10s Average build duration of successful builds in releases after 2024-10-23.
  • Links
  • erihsu/mincost
    9 1 2
  • crates.io
  • Dependencies
  • Versions
  • Owners
  • erihsu

MinCost

A collection of modern heuristic optimization toolkit.

Overwiew

  1. Genetic Algorithm

  2. Simulated Annealing

  3. Particle Swarm

  4. 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:

The project is in the early stage of construction, especially docs && examples.