genetic_algorithm_fn::solutions

Function benchmark_population

Source 
pub fn benchmark_population<R>(
    n_generations: usize,
    size_generation: usize,
    function: &Function,
    n_jobs: usize,
    sample_range: R,
) -> (u64, f64)
where
    R: SampleRange<f64> + Clone,
Expand description

Compute the time in milliseconds that it takes for a genetic algorithm to run.

ยงArguments

  • n_generations - How many generations should the algorithm evolve?
  • size_generation - How many individuals should be selected at the end of each evolution step.
  • dist_mat - What is the distance matrix for your TSP.