On benchmarking functions for genetic algorithms
From MaRDI portal
Publication:2752248
DOI10.1080/00207160108805080zbMath0984.65004OpenAlexW2065401134MaRDI QIDQ2752248
Jason G. Digalakis, Konstantinos G. Margaritis
Publication date: 14 May 2002
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160108805080
genetic algorithmspopulation sizemutation ratebiological evolutionpseudo-random number generationbenchmarking functions
Related Items
On the benefits of Laplace samples in solving a rare event problem using cross-entropy method ⋮ An improved arithmetic optimization algorithm with forced switching mechanism for global optimization problems ⋮ Autonomous particles groups for particle swarm optimization ⋮ A new hybridization approach between the fireworks algorithm and grey wolf optimizer algorithm ⋮ EST-TSA: an effective search tendency based to tree seed algorithm ⋮ Beetle swarm optimization algorithm: Theory and application ⋮ Special forces algorithm: a novel meta-heuristic method for global optimization ⋮ Implementing evolutionary optimization on actual quantum processors ⋮ A special mutation operator in the genetic algorithm for fixed point problems ⋮ Setting targets for surrogate-based optimization ⋮ A dynamic self-adaptive harmony search algorithm for continuous optimization problems
Uses Software
Cites Work
