In order to inherit evolutionary information as living beings during offspring generation, a kind of improved clonal selection algorithm (ICSA) was put forward based on mining excellent gene schema to fill a memory pool from antibody set, applying Gaussian mutation operator, and replacing low affinity antibody with high affinity antibody with probability from mutation antibody population during updating memory antibody population. By combining ICSA with strength Pareto evolutionary algorithm (SPEA), a new kind of evolutionary algorithm (ICSA-SPEA) was proposed, which replaces the genetic operation such as selection, crossover and recombinant with clonal selection. The testing of a multi-objective 0/1 knapsack problem showed that ICSA-SPEA has ability to maintain the diversity of population, and is capable of finding out the well distributed non-dominated solutions approximating to Pareto front.
