An Experimental Study of Benchmarking Functions for Genetic Algorithms

DOI10.1080/00207160210939zbMATH Open1147.68881OpenAlexW2096411220MaRDI QIDQ4531357FDOQ4531357

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

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

zbMATH Keywords

population sizepseudo-random number generatorsgenerational replacement modelgenetic algorithms performancesteady-state replacement model

Mathematics Subject Classification ID

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

Cites Work

• Testing Unconstrained Optimization Software
• Title not available (Why is that?)

Cited In (16)

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

Uses Software

• PGAPack
• GEATbx

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)