Optimization of Contour Path in Laser Processing Based on Dual Coding Improved Genetic Algorithm

Abstract:

In laser processing, optimizing the shortest process time is not equal to optimizing the shortest path, and the spare travel time decided the process time. In this paper, an optimization model for contour path in laser processing is established, in which the minimal spare travel time is taken as objective function, and the improved genetic algorithm is designed to optimize the model. In the optimization of contour path, the processing sequence of loops and starting point in each loop are needed to optimize simultaneously, so the dual integer coding is adopted in the improved genetic algorithm. In the algorithm operational process, the methods of initial solution creating, crossover and mutation that suit with the problem are designed, and the infeasible solutions are avoided. The computing method of fitness value is adjusted, and the improved genetic algorithm takes on some self adapting capability. So the computational efficiency of the method is enhanced.

• Periodical: Applied Mechanics and Materials (Volumes 182-183)
• Pages: 1504-1507
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.182-183.1504
• Online since: June 2012
• Authors: Jian Jun Yang, Hong Zhan, Ji Wen Tan, Yu Cheng Ding
• Keywords: Contour Path, Dual Coding, Improved Genetic Algorithm (IGA), Laser Processing, Path Optimization

References

[1] Y.M. Huang and H.Y. Lan: Int J Adv Manuf Technol Vol. 30(2006), p.233.

[2] C.C. Chou, Y.K. Chen and S.Y. Chou: Integrated Computer-Aided Engineering Vol. 15(2008), p.37.

[3] S.J. Huang and W.C. Shen: Int J Adv Manuf Technol Vol. 27(2005), p.63.

[4] L. Wang and D.Z. Zheng: Computer Engineering and Applications Vol. 38(1) (2002), p.8 (In Chinese).