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

International Journal of Production Research

Volumn 46, Issue 8, 2008, Pages 2299-2311

  Zhu, Guang Yu ^a   Zhang, Wei Bo ^a  

^a FUZHOU UNIVERSITY   (China)

Author keywords

Drilling path optimization; Global convergence; Particle swarm optimization algorithm; PSO

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING;

DRILLING PATH OPTIMIZATION; GLOBAL CONVERGENCE; PARTICLE SWARM OPTIMIZATION ALGORITHMS;

PARTICLE SWARM OPTIMIZATION (PSO);

EID: 39449097797     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540601042480     Document Type: Article

References (18)

1. Clerc, M., Discrete particle swarm optimization illustrated by the travelling salesman problem. Available online at: http://clerc.maurice.free.fr/ pso/pso_tsp/Discrete_PSO_TSP.htm (accessed 5 April 2006).
2. Cui, Z., Zeng, J. and Cai, X., A new stochastic particle swarm optimizer, in Conference Evolutionary Computation 2004, 2004, 1, 316-319.
3. Kennedy, J. and Eberhart, R.C., Particle swarm optimization. IEEE Proceedings of the International Conference on Neural Networks IV, 1995, pp. 1942-1948.
4. Khan, W.A., Hayhurst, D.R. and Cannings, C., Determination of Optimal Path Under Approach And Exit Constraints. Eur. J. Oper. Res., 1999, 117, 310-325.
5. Kolahan, F. and Liang, M., Optimization of hole-making operations: a tabu-search approach. Int. J. Mach. Tools and Manuf., 2000, 40, 1735-1753.
6. Lopes, H.S. and Coelho, L.S., Particle swarm optimization with fast local search for the blind travelling salesman problem, in 5th International Conference on Hybrid Intelligent Systems Proceedings, 2005, pp. 245-250.
7. Onwubolu, G.C. and Clerc, M., Optimal path for automated drilling operations by a new heuristic approach using particle swarm optimization. Int. J. Prod. Res., 2004, 42, 473-491.
8. Palbom, A., Worst Case Performance of an Approximation Algorithm for Asymmetric TSP, in 21st Annual Symposium on Theoretical Aspects of Computer Science, 2004, pp. 465-476.
9. Ponnambalam, S.G., Jagannathan, H., Kataria, M. and Gadicherla, A., A TSP-GA multi-objective algorithm for flow-shop scheduling. Int. J. Adv. Manuf. Tech., 2004, 23, 909-915.
10. Schneider, J., The time-dependent travelling salesman problem. Physica A, 2002, 314, 151-155.
11. Solis, F. and Wets, R., Minimization by random search techniques. Math. Oper. Res., 1981, 6, 19-30.
12. Song, M.-P. and Gu, G.-C., Research on particle swarm optimization: a Review, in Proceedings of the Third International Conference on Machine Learning and Cybernetics, 2004, pp. 2236-2241.
13. Tong, X., Chen, Y. and Wang, J., Leather cutting algorithm design. J. Comput. Aid. Desi. & Comput. Graphics, 2005, 17, 1642-1646 (In Chinese).
14. Van den Bergh, F., An analysis of particle swarm optimizers. PhD thesis, University of Pretoria, 2001.
15. Wang K.-P., Huang L, Zhou C.-G. and Pang, W., Particle swarm optimization for travelling salesman problem, in 2003 International Conference on Machine Learning and Cybernetics, 2003, pp. 1583-1585.
16. Xiao, R.-B. and Tao, Z.-W., Solution to holes machining path planning by evolutionary methods. Comput. Integr. Manuf, 2005, 11, 682-689, (In Chinese).
17. Zhang, W.-B., Lu, Z.H. and Zhu, G.-Y., Optimization of process route by genetic algorithms. Robot. Cim.-Int. Manuf, 2006, 22, 180-188.
18. Zhou, K. and Shao, H., Machining route optimization in drilling holes based on hopfield algorithm. Mould technology, 2003, 21, 48-50 (In Chinese).