A Solution of Irregular Parts Nesting Problem Based on Immune Genetic Algorithm

摘要

A novel solution for two dimension irregular parts nesting with immune genetic algorithm (IGA) was presented, which overcome the shortages of premature constringency and low efficiency existing in genetic algorithms (GA). IGA introduced immune memory and concentration mechanism to improve searching speed and the ability of keeping the diversity of population. The method combined with remaining rectangle matching and orthogonal accessing algorithm to realize automatic nesting of irregular parts. Its effectiveness has been fairly proved in solving irregular parts nesting problem.