论文部分内容阅读
首先对空中加油问题进行了分析,提取了相关性质,在此基础上建立了问题的递推模型.根据该模型,提出了一种启发式搜索算法.该算法计算复杂度低,适用性好.对应于辅机是否可以多次起飞,该算法分为两子算法.对这两种不同情况下的具体问题,设计了相关的优化函数.所有算法都在计算机中运行,并得到了相应结果.值得指出的是,提出的启发式搜索算法十分高效.对于问题1和问题2,该算法所得解是约束条件下的最优调度策略.对于问题3,问题4,问题5,该算法所得解逼近最优调度策略.
Firstly, the air refueling problem is analyzed, the relevant properties are extracted, and based on this, a recursive model of the problem is established. According to the model, a heuristic search algorithm is proposed, which has low computational complexity and good applicability. The algorithm is divided into two sub-algorithms, corresponding to whether the auxiliary engine can take off many times, and the relevant optimization functions are designed for the specific problems in the two different situations. All the algorithms are run in the computer and the corresponding results are obtained. It is worth pointing out that the proposed heuristic search algorithm is very efficient.For the problem 1 and problem 2, the solution of this algorithm is the optimal scheduling strategy under the constraint conditions.For the problem 3, the problem 4, the problem 5, Optimal scheduling strategy.