Restricting the class of problems we want to perform well on allows Black Box Search Algorithms (BBSAs) specifi- cally tailored to that class to significantly outperform more general purpose problem solvers. However, the fields that encompass BBSAs, including Evolutionary Computing, are mostly focused on improving algorithm performance over increasingly diversified problem classes. By definition, the payoff for designing a high quality general purpose solver is far larger in terms of the number of problems it can ad- dress, than a specialized BBSA. This paper introduces a novel approach to creating tailored BBSAs through auto- mated design employing genetic programming. An exper- iment is reported which demonstrates its ability to create novel BBSAs which outperform established BBSAs includ- ing canonical evolutionary algorithms.
- Black-Box Search Algorithms,
- Evolutionary Algorithms,
- Genetic Programming
Available at: http://works.bepress.com/daniel-tauritz/35/