Abstract: To deal with setup planning in computer aided process planning, a novel setup planning method based on memetic algorithm is proposed. By analyzing geometric characteristics of the part, machining features and units are determined and representation of setup planning is established. The initialize population of setup planning is configured by candidate tool approach direction, machines and cutter for each machining unit. Setup planning is searched in the global scope by partial mapped crossover and insertion mutation. Based on sequence constraints between units, binary tree sort algorithm is adopted to transform from infeasible solution to feasible solution. The sum of the processing methods similarity between machining units is taken as fitness function, setup planning of high fitness value can be acquired in local search by crossover operation based on fitness rate and mutation operation of non-sequential constraint machining units. After the evolution of populations, optimal setup planning solution is generated. Setup planning process of typical part is illustrated to prove the feasibility of the proposed model.

Key words: memetic algorithm, processing sequence constraints, setup planning