Abstract: The aircraft range problem is discussed in this paper. By introducing a kind of exploration problem with n vehicles, this paper proposes that n-vehicle exploration problem is a special case of aircraft range problem. Based on the consequence, and by considering a special case that proves solvable of n-vehicle problem, akind of special case of aircraft range problem is obtained, along with the calculation method for optimal sequence and the greatest flight distance. Numerical examples are displayed at last.

Key words: operational research, dynamic programming, optimal sequence, aircraft range problem, jeep problem, n-vehicles exploration problem, special case

摘要： 本文研究了一类航空器排列问题。通过分析n车探险问题及其特例情况,发现n车探险问题为航空器排列问题的一种特例情况,基于此结论,从航空器排列问题的条件结构入手,将n车探险问题特例情况的算法应用到航空器排列问题上,提出航空器排列问题的另一个特例情况,并给出该特例情况下最优排序以及最远飞行距离计算方法。文章最后给出计算实例。

关键词: 运筹学, 动态规划, 最优排序方法, 航空器排列问题, 吉普车问题, n车探险问题, 特例情况