Experimental study of seeding in genetic algorithms with non-binary genetic representation

Seeding is a technique used to leverage population diversity in genetic algorithms. this paper presents a quick survey of different seeding approaches, and evaluates one of the promising ones called the seeding genetic algorithm. the seeding ga does not include mutation, and it has been shown to work well on some ga-hard problems with binary representation, such as the hierarchical if-and-only-if or deceptive trap. this paper investigates the effectiveness of the seeding ga on two problems with more complex non-binary representations: capacitated lot-sizing and single-machine scheduling. the results show, with statistical significance, that the new ga is consistently outperformed by the conventional ga, and that not including mutation is the main reason why. a detailed analysis of the results is presented and suggestions are made to enhance and improve the method.