An Empirical Comparison of Seven Iterative and Evolutionary Function Optimzation Heuristics

September 1995

An Empirical Comparison of Seven Iterative and Evolutionary Function Optimzation Heuristics

Authors:

Shumeet Baluja
Technical Report
CMU-CS-95-193

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 2368 to 22040. 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.
@techreport{Baluja-1995-13994,
author = {Shumeet Baluja},
title = {An Empirical Comparison of Seven Iterative and Evolutionary Function Optimzation Heuristics},
year = {1995},
month = {September},
institute = {Carnegie Mellon University},
address = {Pittsburgh, PA},
number = {CMU-CS-95-193},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.