Work

An Empirical Comparison of Seven Iterative and Evolutionary Function Optimization Heuristics

Year: 1995
Type: article
Abstract: This report is a repository for the results obtained from a large scale empirical comparison of seven iterative and evolution-based optimization heuristics. Twenty-seven static optimization problems, spanning six sets of problem classes which are commonly explored in genetic algorithm literature, are examined. The problem sets include job-shop scheduling, traveling salesman, knapsack, binpacking, neural network weight optimization, and standard numerical optimization. The search spaces in these problems range from 2^368 to 2^2040. The results indicate that using genetic algorithms for the optimization of static functions does not yield a benefit, in terms of the final answer obtained, over simpler optimization heuristics. Descriptions of the algorithms tested and the encodings of the problems are described in detail for reproducibility.
Language: English
Open Access status: green
OpenAlex ID: W1769790294
FWCI: 7.079
Cites: 26
Cited by: 135
Related to: 10