10.6084/m9.figshare.640022.v1
Maxinder S Kanwal
Avinash S Ramesh
Lauren A Huang
Accuracies, run times, and statistics for genetic algorithms with various mutation rates solving the N-queens problem.
2013
f1000research.com
Genetic Algorithm
adaptive mutation
N-queens problem
2013-06-20 06:18:35
article
https://f1000.figshare.com/articles/dataset/Accuracies_run_times_and_statistics_for_genetic_algorithms_with_various_mutation_rates_solving_the_N_queens_problem_/640022
<p>In the nqueensnomut, nqueensconstmut, and nqueenssigmoid tabs, the end heuristic (number of queens attacking each other on the board, with 0 m) found by that genetic algorithm is displayed along with the time the algorithm took to converge to that solution (in generations). In the stats tabs, t-tests are run to compare the accuracies and convergence generations among the different mutation rate genetic algorithms.<br>Key: mut rate: mutation rate, converg: convergence (generations), end h (end heuristic) nomut: no mutation, constmut, constant mutation.</p>