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

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