An Improved General Particle Swarm Optimization (IGPSO) algorithm was proposed for process planning problem based on the GPSO model and the characteristics of procwss planning problem. Crossover operations were utilized to achieve the particles to obtain updated information from individual extreme library and population extreme library. Variable Neighborhood Search was intaoduced as a local search strategy for particles. A set of instances have been conducted to examine the proposed algorithm and the comparisons among other algorithms appeared in current literature were also presented. The experimental results showed the proposed algorithm had higher efficiency and better stability in solving process planning problems.

undefined