| Summary: | Mutation in a Genetic Algorithm is the key variation operator adjusting the genetic diversity in a population throughout the evolutionary process. Often, a fixed mutation probability is used to perturb the value of a gene. In this study, we describe a novel data science approach to adaptively generate the mutation probability for each locus. The trail of high quality candidate solutions obtained during the search process is represented as a 3rd order tensor. Factorizing that tensor captures the common pattern between those solutions, identifying the degree of mutation which is likely to yield improvement at each locus. An online bin packing problem is used as an initial case study to investigate the proposed approach for generating locus dependent mutation probabilities. The empirical results show that the tensor approach improves the performance of a standard Genetic Algorithm on almost all classes of instances, significantly.
|
|---|