Scanning path optimization of fiber detection device by using TSP

Abstract

Optimizing the scanning path of the fiber detection device helps to further reduce the detection time and improve the detection efficiency. Considering that each fiber must be detected and detected only once, which has the basic characteristics of the traveling salesman problem (TSP)，so an anchor box algorithm for fiber coordinate transformation of 4x objective lens coarse scanning and 40x fine scan was proposed. Aimed at the motor motion mode in the scan process, the distance evaluation formula of the TSP mathematical model was modified, the meta-heuristic, heuristic and other algorithms were used to solve the optimal path, three different scales of 800, 1 200, and 1 500 points were selected for scanning path distance and time test. The experiment results show that compared with the traditional Z-type global scan method, the proposed shortest time scan algorithm reduces the total scan path length by 53.0％~67.7% and the total scanning time by 21.0％~41.9%.

Keywords

• fiber detection
• path optimization
• traveling salesman problem
• anchor box algorithm