Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Computer Sciences
A Case For Exhaustive Optimization, Sanza Kazadi, Michele Lee, Lauren Lee
A Case For Exhaustive Optimization, Sanza Kazadi, Michele Lee, Lauren Lee
Sanza Kazadi
Evolutionary algorithms have enjoyed a great success in a variety of different fields ranging from numerical optimization to general creative design. However, to date, the question of why this success is possible has never been adequately determined. In this paper, we examine two algorithms: a genetic algorithm and a pseudo-exhaustive search algorithm dubbed Directed Exhaustive Search. We examine the GA's apparent ability to compound individual mutations and its role in the GA's optimization. We then explore the use of the DES algorithm using a suitably altered mutation operator mimicking the GA's surreptitious compounding of the mutation operator. We find that …