Abstract
Immune Algorithm (IA) is an optimization algorithm which searches for multiple optimal and semi-optimal solutions by antibody reproduction and self suppression. This paper focuses on Bin Packing problem (BP), one of typical optimization problems, in which the effectiveness of IA has not been verified yet. This paper proposes IA to solve BP, discusses parameter configuration ways, and compares the search performance between existing genetic algorithm (GA) and IA. Experimental results have shown that IA could find optimal solutions even in the problems GA cannot solve.
