Genetic Algorithms and Explicit Search Statistics
Conference Paper, Proceedings of (NeurIPS) Neural Information Processing Systems, pp. 319 - 325, December, 1996
Abstract
The genetic algorithm (GA) is a heuristic search procedure based on mechanisms abstracted from population genetics. In a previous paper [Baluja & Caruana, 1995], we showed that much simpler algorithms, such as hillclimbing and Population-Based Incremental Learning (PBIL), perform comparably to GAs on an optimization problem custom designed to benefit from the GA's operators. This paper extends these results in two directions. First, in a large-scale empirical comparison of problems that have been reported in GA literature, we show that on many problems, simpler algorithms can perform significantly better than GAs. Second, we describe when crossover is useful, and show how it can be incorporated into PBIL.
BibTeX
@conference{Baluja-1996-14269,author = {Shumeet Baluja},
title = {Genetic Algorithms and Explicit Search Statistics},
booktitle = {Proceedings of (NeurIPS) Neural Information Processing Systems},
year = {1996},
month = {December},
pages = {319 - 325},
}
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.