Method to achieve better performance in genetic algorithms applied to time-constrained, multi-solution problems

Abstract

It has been demonstrated that a periodic complete reinitialization of a running genetic algorithm (GA) solution will result in a higher convergence rate for a series of problems. This technique, referred to as the "total-comet-strike" operator, has been applied to a number of multi-solution GA problems. Where it has been used, an improvement has been shown both in the number of cases that converge within an imposed time limit and in the average time required for each case.