试飞科目的最优排序问题研究

以试飞科目间总的过渡耗油、耗时最省为性能指标，在建立过渡耗油、耗时计算数学模型的基础上，应用“旅行推销员”问题的ＥＡＳＴＭＡＮ解法及最近相邻点启发性解法两种方法对试飞科目的最优排序问题进行了研究。分析了两种方法的适用范围及限制条件，ＥＡＳＴＭＡＮ解法适用于起点和终点为同一科目的问题，最近相邻点启发性解法则是一种适用于开环问题的工程解法。仿真结果表明，通过合理安排试飞科目次序，可节省试飞耗油，耗时，

Study on Optimal Ordering Problem of Flight Test Maneuvers

While modeling the calculation of the fuel and time of transition maneuvers between flight maneuvers, with the criterion of the minimum fuel or the time used in transition maneuvers of flight test, this paper studies the optimal ordering problem of flight test maneuvers by two methods. The first is ESTMAN algorithm for the traveling salesman problem, it can be utilized while the first flight test maneuvers is the same as the final one. The second is the heuristic solution method for the closest adjacent points, i.e. engineering method. It is adapted to the open loop problem. The application range and the limit condition of two methods are analyzed. The results show that reasonably arranging the sequence of flight test maneuvers can make best use of fuel and time available in flight test, then the cost is saved and the efficiency of flight test improved.