Module metaheuristics::random_search [−][src]
Expand description
Find an approximate solution to your optimisation problem using Random Search
Note: This isn’t really a useful algorithm and is only included for completness.
At each iteration, generate an independantly random solution. When the time runs out, return the best solution found.
Examples
ⓘ
let solution = metaheuristics::random_search::solve(&mut problem, runtime);
Functions
Returns an approximate solution to your optimisation problem using Random Search