On the utility of randomly generated functions for performance evaluation of evolutionary algorithms

DOI10.1007/s11590-010-0181-2zbMath1202.90274OpenAlexW2014372644MaRDI QIDQ601978

Ali Ahrari, Reza Ahrari

Publication date: 29 October 2010

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-010-0181-2

zbMATH Keywords

performance evaluationevolutionary algorithmsblack-box problemsrandomly generated functions

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Related Items (5)

An improved evolution strategy with adaptive population size ⋮ Artificial bee colony algorithm combined with grenade explosion method and Cauchy operator for global optimization ⋮ Improving differential evolution through a unified approach ⋮ The block diagram method for designing the particle swarm optimization algorithm ⋮ Global optimization test problems based on random field composition

Uses Software

• Algorithm 829
• CMA-ES
• SIGOA
• ABC
• CEC 05

Cites Work

• On the limitations of classical benchmark functions for evaluating robustness of evolutionary algorithms
• The GLOBAL optimization method revisited
• GEM: A novel evolutionary optimization method with improved neighborhood search
• A collection of test problems for constrained global optimization algorithms
• Test functions with variable attraction regions for global optimization problems
• A new filled function applied to global optimization.
• Recent developments and trends in global optimization
• A comparative study of artificial bee colony algorithm
• A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
• Facts, Conjectures, and Improvements for Simulated Annealing
• Algorithm 829

This page was built for publication: On the utility of randomly generated functions for performance evaluation of evolutionary algorithms