关键词: 测量序列规划, 离散萤火虫算法, 适应度函数模型, 旅行商问题

Abstract: To solve the measuring sequence planning problem of contact point,the equivalent Traveling Salesman Problem (TSP) model was built,and the firefly algorithm was used to solve this model.The discrete operation for Firefly Algorithm (FA) was made,and a new distance pattern was created to represent the distance between two fireflies.The iteration and random rules of Discrete Firefly Algorithm (DFA) were improved,and a kind of Improved DFA (IDFA) was obtained.To implement the algorithm,the fitness function including path length,path smoothness and rotate distance of probe was constructed.A leaf-type part was taken as the example to make the contrast test of DFA and IDFA,and the results showed that the proposed algorithm was efficiency and the fitness function was feasible.The contrast experiment on IDFA and Genetic Algorithm (GA) was conducted for measuring planning of another free-form surface,and the results showed that the performance of IDFA was significantly better than GA.

Key words: measuring sequence planning, discrete firefly algorithm, fitness function model, traveling salesman problem