Drilling path optimization by the particle swarm optimization algorithm with global convergence characteristics

Drilling path optimization is one of the key problems in holes-machining. This paper presents a new approach to solve the drilling path optimization problem belonging to discrete space, based on the particle swarm optimization (PSO) algorithm. Since the standard PSO algorithm is not guaranteed to be global convergent or local convergent, based on the mathematical model, the algorithm is improved by adopting the method to generate the stop evolution particle once again to obtain the ability of convergence on the global optimization solution. Also, the operators are proposed by establishing the Order Exchange Unit (OEU) and the Order Exchange List (OEL) to satisfy the need of integer coding in drilling path optimization. The experimentations indicate that the improved algorithm has the characteristics of easy realization, fast convergence speed, and better global convergence capability. Hence the new PSO can play a role in solving the problem of drilling path optimization.

[1]  Roger J.-B. Wets,et al.  Minimization by Random Search Techniques , 1981, Math. Oper. Res..

[2]  Time-Dependent Travelling Salesman Problem , 2005 .

[3]  Zhihua Cui,et al.  A new stochastic particle swarm optimizer , 2004, IEEE Congress on Evolutionary Computation.

[4]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[5]  Cui Zhihua,et al.  A new stochastic particle swarm optimizer , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[6]  Ming Liang,et al.  Optimization of hole-making operations: a tabu-search approach , 2000 .

[7]  D. R. Hayhurst,et al.  Determination of optimal path under approach and exit constraints , 1999, Eur. J. Oper. Res..

[8]  Xiao Renbin,et al.  Solution to holes machining path planning by evolutionary methods , 2005 .

[9]  Guo-Chang Gu,et al.  Research on particle swarm optimization: a review , 2004, Proceedings of 2004 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.04EX826).

[10]  S. Ponnambalam,et al.  A TSP-GA multi-objective algorithm for flow-shop scheduling , 2004 .

[11]  Frans van den Bergh,et al.  An analysis of particle swarm optimizers , 2002 .

[12]  Leandro dos Santos Coelho,et al.  Particle Swarn Optimization with Fast Local Search for the Blind Traveling Salesman Problem , 2005, Fifth International Conference on Hybrid Intelligent Systems (HIS'05).

[13]  Chunguang Zhou,et al.  Particle swarm optimization for traveling salesman problem , 2003, Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693).

[14]  Godfrey C. Onwubolu,et al.  Optimal path for automated drilling operations by a new heuristic approach using particle swarm optimization , 2004 .

[15]  J. Schneider.  The time-dependent traveling salesman problem , 2002 .

[16]  Zhang Wei Bo,et al.  Optimization of process route by Genetic Algorithms , 2006 .

[17]  Anna Palbom.  Worst Case Performance of an Approximation Algorithm for Asymmetric TSP , 2004, STACS.