以试飞科目间总的过渡耗油、耗时最省为性能指标 ,在建立过渡耗油、耗时计算数学模型的基础上 ,应用“旅行推销员”问题的 EASTMAN解法及最近相邻点启发性解法两种方法对试飞科目的最优排序问题进行了研究。分析了两种方法的适用范围及限制条件 ,EASTMAN解法适用于起点和终点为同一科目的问题 ,最近相邻点启发性解法则是一种适用于开环问题的工程解法。仿真结果表明 ,通过合理安排试飞科目次序 ,可节省试飞耗油、耗时 ,减少试飞成本 ,提高试飞效率。 Based on the transitional fuel consumption and time-consuming mathematical model, the EASTMAN solution of “traveling salesman” problem and the enlightenment of the nearest neighbors Solution method two kinds of methods to test the subject of the optimal sorting problem were studied. The applicability and limitations of the two methods are analyzed. The EASTMAN solution is suitable for the problem that the starting point and the ending point are the same subjects. The nearest heuristic solution for neighbors is a kind of engineering solution suitable for open-loop problem. The simulation results show that by reasonably arranging the order of flight test subjects, it is possible to save test flight fuel consumption, time-consuming, reduce test flight costs and improve flight test efficiency.