On the parallel execution of combinatorial heuristics

The effectiveness of combinatorial search heuristics, such as genetic algorithms (GA), is limited by their ability to balance the need for a diverse set of sampling points with the desire to quickly focus search upon potential solutions. One of the methods often used to address this problem is to simulate the theory of punctuated equilibria in the GA. The GA introduced uses the basic premises derived from punctuated equilibria, but hopes to remedy the problems associated with sudden introduction of new genetic material by relying upon a much greater degree of distribution and an overlapping population architecture. Presented here is a description and preliminary empirical test results of a massively distributed parallel genetic algorithm (mdpGA)