|
Abstract:
|
We theoretically explore some of the properties of evolutionary algorithms. We discover that under certain conditions, it is more advantageous to utilize a restarting procedure for the evolutionary algorithm than to continue to allow the algorithm to run, due to an exponentially increasing time required for transitions between optima. We discover conditions where a pseudoexhaustive algorithm based on a given evolutionary algorithm may be able to outperform the evolutionary algorithm on which it is based. The algorithm is shown to perform as well or better than the evolutionary algorithm it is built from on problems taken from the literature and a digital hardware design problem.
|
