Solution to Holes Machining Path Planning by Intelligence Computation

Abstract:

The rapid development of electronic information industry has posed serious challenges to the electronics manufacturing technology and intense competition in the market. For the most basic parts of electronic components - holes of the printed circuit board processing efficiency issues need to be resolved, the machining tool path optimization techniques. Optimize holes machining path reducing tool movement time is an effective way to improve production efficiency. Machining path optimization problem is transformed into a traveling salesman problem, shortest processing path established path optimization mathematical model on the basis of the model, the analysis of a variety of typical optimization algorithm, simulated annealing algorithm, genetic algorithm, ant colony algorithm, particle swarm optimization, comparing the various algorithms, based on theoretical analysis and experimental research, for the complexity of the algorithm evaluation, flexibility, local optimum probability, feedback information utilization and weight.

• Periodical: Applied Mechanics and Materials (Volume 319)
• Pages: 491-496
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.319.491
• Online since: May 2013
• Authors: Jing Zhang
• Keywords: Holes Machining Path Planning, Intelligence Computation, Traveling Salesman Problem (TSP)

References

[1] Johnson D , Mcgeoch L. The traveling salesman problem: a case study in local optimization. In: Local Search in Optimization . New York : John Wiley and Sons, 1997: 215-310.

DOI: 10.2307/j.ctv346t9c.13

[2] Grefenstettee J J .Genetic Algorithms for the Salesman Problem. In: Proceedings of the First International Conference on Genetic Algorithms , Lawrence Erlbaum Associates, Publishers, 1985, 160-165.

[3] Jing Zhang. A New Non-monotone Line Search Algorithm for Nonlinear Programming. Przeglad Elektrotechniczny, 2012, 88(7b): 265-268.

[4] Conley W C. Programming an automated punch or drill Int. Systems SCL, 1991, 22 (2): 2039-2025.

[5] Kennedy J. The particle swarm: social adaptation of knowledge. Proc of IEEE Int Conf on Evolutionary Computation. Indianapolis, 1997: 303-308.

[6] Jing Zhang. Modeling and Solution for Multiple Chinese Postman Problems. Communications in Computer and Information Science, 2011, 215(2): 520-525.

[7] Kennedy J, Eberhart R C. Particle swarm optimization. Proc of IEEE Int Conf on NeuralNetworks. Piscataway, 1995: 1942-1948.

[8] Jelmer Van A, Robert B, Bart De S. Particle swarms in optimization and control. in: Proceedings of the 17th World Congress The International Federation of Automatic Control, Seoul, Korea, 2008, 5131-5136.

[9] Banks A, Vincent J, Anyakoha C. A review of particle swarm optimization. Part I: background and development. Natural Computing, 2007, 45(6): 467-484.

DOI: 10.1007/s11047-007-9049-5

[10] Parsopoulos K, Vrahatis M. Recent approaches to global optimization problems through particle swarm optimization. Natural Computing, 2002, 40(1): 235-306.

[11] Eberhart R, Shi Y. Particle swarm optimization: Developments, applications and resources. in: Proc. IEEE Congr. Evol. Comput. 2001, 1(1): 81-86.

[12] Bonabeau E, Dorigo M, Theraulaz G. Inspiration for optimization from social insect behavior．Nature, 2000, 406(6791): 39-42.

DOI: 10.1038/35017500

[13] Dorigo M, Bonabeau E, Theraulaz G. Ant algorithms and stigmergy. Future Generation computer systems, 2000, 16(8): 851-871.

DOI: 10.1016/s0167-739x(00)00042-x

[14] Krikpatrick S, Gelett C,Veechi M. Optimization by simulated annealing. Science, 1983(8): 671-680.