An Experimental Study of Benchmarking Functions for Genetic Algorithms

DOI10.1080/00207160210939MaRDI QIDQ4531357zbMATH OpenOpenAlexFDO

Authors Jason G. Digalakis, Konstantinos G. Margaritis

Publication date 2 July 2002

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160210939

zbMATH Keywords

generational replacement modelgenetic algorithms performancepopulation sizepseudo-random number generatorssteady-state replacement model

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• On benchmarking functions for genetic algorithms
• Genetic algorithms and their testing
• scientific article; zbMATH DE number 2087677
• On genetic operators for unconstrained optimization problems
• Theoretical and experimental study of crossover operators of genetic algorithms

Cites work

• scientific article; zbMATH DE number 1424211 (Why is no real title available?)
• Testing Unconstrained Optimization Software

Cited in

(16)

• Chaotic league championship algorithms
• Trees social relations optimization algorithm: a new swarm-based metaheuristic technique to solve continuous and discrete optimization problems
• Chaos based optics inspired optimization algorithms as global solution search approach
• A comparative study of artificial bee colony algorithm
• On benchmarking functions for genetic algorithms
• Unsupervised classifier based on heuristic optimization and maximum entropy principle
• An optimal feedback control framework for grasping objects with position uncertainty
• Studying the Effects of Dual Coding on the Adaptation of Representation for Linkage in Evolutionary Algorithms
• DIVERSITY-BASED INFORMATION EXCHANGE AMONG MULTIPLE SWARMS IN PARTICLE SWARM OPTIMIZATION
• A novel hybrid vortex search and artificial bee colony algorithm for numerical optimization problems
• A diversification operator for genetic algorithms
• BGSA: Binary gravitational search algorithm
• Chaos embedded particle swarm optimization algorithms
• On the utility of randomly generated functions for performance evaluation of evolutionary algorithms
• A hybrid shuffled complex evolution approach based on differential evolution for unconstrained optimization
• The Pareto fitness genetic algorithm: test function study

Describes a project that uses

Uses Software

• GEATbx
• PGAPack

This page was built for publication: An Experimental Study of Benchmarking Functions for Genetic Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4531357)