基于广义粒子群优化模型的工艺规划方法研究
Research on Process Planning Problems Based on General Particle Swarm Optimization Model

在广义粒子群优化模型基础上，结合工艺规划问题的特性，设计了求解工艺规划问题的广义粒子群优化算法。该算法采用当前粒子与个体极值库、种群极值库进行交叉操作的方式，使粒子能够从个体极值和种群中获取更新信息，引入变邻域搜索算法作为粒子的局部搜索和随机搜索策略。实例测试结果显示，与其他算法相比，本文算法在求解工艺规划问题时具有更高的求解效率和更好的稳定性.。
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.