抄録
While immune algorithms are proposed based on a somatic theory and a network hypothesis, it has been so far considered that immune algorithms are different from genetic algorithms on the basis of specific simulation results using typical combinatorial and nonconvex global optimization problems. This paper discusses the similarity between immune algorithms and genetic algorithms from the viewpoint of optimization. Simulation results using typical optimization problems are examined from the viewpoint of numerical experiment in this paper, after the similarity is investigated from the practical viewpoint of optimization methods.
