Immune Algorithms for Multi-solution Based on Partition and Local Recombination

Dealing with multi-solution problems by intelligent computations is a new research focus. Searching multi-solution has wide-ranging practical background and broad applied significance, and it also is a very difficult problem. The relation between multi-solution and diversity is inherent. Diversity feature of immunity has advantages in searching multi-solution. Methods of partition and local recombination are designed in order to effectively increase number of solutions and decrease the computational expensiveness of algorithms. Then a suitable or reasonable algorithm model for multi-solution problems based on immunities with partition and local recombination is present. Finally simulation experiments prove the feasibility of the method.