Skip to content

Latest commit

 

History

History
58 lines (42 loc) · 2.88 KB

README.md

File metadata and controls

58 lines (42 loc) · 2.88 KB
Raw

metaheuristics-nature

dependency status documentation

A collection of nature-inspired metaheuristic algorithms. This crate provides an objective function trait, well-known methods, and tool functions to implement your searching method.

This crate implemented the following algorithms:

  • Real-coded Genetic Algorithm (RGA)
  • Differential Evolution (DE)
  • Particle Swarm Optimization (PSO)
  • Firefly Algorithm (FA)
  • Teaching-Learning Based Optimization (TLBO)

Side functions:

  • Parallelable Seeded Random Number Generator (RNG)
    • This RNG is reproducible in single-thread and multi-thread programming.
  • Pareto front for Multi-Objective Optimization (MOO)
    • You can return multiple fitness in the objective function.
    • All fitness values will find the history-best solution as a set.

Each algorithm gives the same API and default parameters to help you test different implementations. For example, you can test another algorithm by replacing Rga with De.

use metaheuristics_nature as mh;

let mut report = Vec::with_capacity(20);

// Build and run the solver
let s = mh::Solver::build(mh::Rga::default(), mh::tests::TestObj)
    .seed(0)
    .task(|ctx| ctx.gen == 20)
    .callback(|ctx| report.push(ctx.best.get_eval()))
    .solve();
// Get the optimized XY value of your function
let (xs, p) = s.as_best();
// If `p` is a `WithProduct` type wrapped with the fitness value
let err = p.ys();
let result = p.as_result();
// Get the history reports
let y2 = &report[2];

What kinds of problems can be solved?

If your problem can be simulated and evaluated, the optimization method efficiently finds the best design! 🚀

Assuming that your simulation can be done with a function f, by inputting the parameters X and the evaluation value y, then the optimization method will try to adjust X={x0, x1, ...} to obtain the smallest y. Their relationship can be written as f(X) = y.

The number of the parameters X is called "dimension". Imagine X is the coordinate in the multi-dimension, and y is the weight of the "point." If the dimension increases, the problem will be more challenging to search.

The "metaheuristic" algorithms use multiple points to search for the minimum value, which detects the local gradient across the most feasible solutions and keeps away from the local optimum, even with an unknown gradient or feasible region.

Please have a look at the API documentation for more information.

Gradient-based Methods

For more straightforward functions, for example, if the 1st derivative function is known, gradient-based methods are recommended for the fastest speed. Such as OSQP.