Application of Improved Dual Coding Genetic Algorithm for Contour Path Planning in Laser Processing

摘要

An optimization model for contour path in laser processing is established, in which the minimal spare travel time is taken as objective function and not the shortest path, because the spare travel time decided the processing time. In the problem, two kinds of subpromlems that are the scanning sequence of contours and the starting point of each contour should be optimized simultaneously. Based on the features, the improved dual coding genetic algorithm is designed to optimize the problem. For the contour shape, the polygon and circle are all taken into account and the coding method that adapted to the problem is designed. In the algorithm operational process, many crossover and mutation methods are designed and also adapted to the problem, so the infeasible solutions are avoided. In order to improve the performance of the algorithm, the computing method of fitness function value is adjusted. The computation result shows that the algorithm is efficiency.