新的求解钻削路径优化问题算法研究

Research of new algorithm for drilling path optimization

将粒子群优化算法应用到离散空间的群孔钻削路径优化之中。由于基本粒子群算法不能保证全局或局部收敛,在算法数学模型的基础上,引入重新生成停止进化微粒的方式对算法加以改进,使改进的算法具有全局收敛能力。通过建立序交换元和序交换集对算法的操作算子进行改进,满足钻削路径优化问题中整数编码的需要。实验表明,新的算法具有实现简单,收敛速度快,能够实现全局收敛的优点。

In this paper a new approach based on the particle swarm optimization (PSO) algorithm is repre- sents for solving the drilling path optimization problem belonging to discrete space.Because the standard parti- cle swarm algorithm is not guaranteed to be global convergence or local convergence,based on the mathemati- cal model,the algorithm is improved by adopting the method of generating the stop evolution particle over a- gain to get the ability of convergence on the global optimization solution.And the operators are improved by establishing the Order Exchange Unit and Order Exchange List to satisfy the need of integer coding in drilling path optimization.The experiment indicates that the improved algorithm has the characteristics of easy real- ization,fast convergence speed and better global convergence capability.Hence the new PSO can play a role in solving the problem of drilling path optimization in drilling holes.