关键词: 航路规划, 可见性图, Dijkstra算法, 组合优化, 遗传算法

Abstract: The flying test of an opto-electronic module has high demand to the aircraft route, and a route that satisfies the constraints of the test is the precondition to fulfill the objective of the test. According to this question, a search space construction method based on visibility graph is used here；the shortest polylines path between two targets is got by the Dijkstra algorithm；the GA algorithm is used to get an optimized order of targets；then the final route is got from the polylines path and minimum turning radius is satisfied. The result shows that this route computing method can be well used to get an aircraft route which satisfies the constraints of the opto-electronic module test.

Key words: route planning, visibility graph, Dijkstra algorithm, combinational optimization, Genetic Algorithm（GA）