| 空中加油问题的递推模型与调度策略 |
| |
| 引用本文： | 胡亚峰,胡爱军,王煜航,张贤达.空中加油问题的递推模型与调度策略[J].数学的实践与认识,2006,36(7):63-71. |
| |
| 作者姓名： | 胡亚峰 胡爱军 王煜航 张贤达 |
| |
| 作者单位： | 1. 清华大学自动化系,北京,100084
2. 清华大学电机系,北京,100084 |
| |
| 摘 要： | 首先对空中加油问题进行了分析,提取了相关性质,在此基础上建立了问题的递推模型.根据该模型,提出了一种启发式搜索算法.该算法计算复杂度低,适用性好.对应于辅机是否可以多次起飞,该算法分为两子算法.对这两种不同情况下的具体问题,设计了相关的优化函数.所有算法都在计算机中运行,并得到了相应结果.值得指出的是,提出的启发式搜索算法十分高效.对于问题1和问题2,该算法所得解是约束条件下的最优调度策略.对于问题3,问题4,问题5,该算法所得解逼近最优调度策略.
|
| 关 键 词： | 空中加油 递推模型 启发式算法 搜索 |
The Recursive Models of Air Refueling Mission and Their Scheduling Strategies |
| |
| HU Ya-feng,HU Ai-jun,WANG Yu-hang,ZHANG Xian-da.The Recursive Models of Air Refueling Mission and Their Scheduling Strategies[J].Mathematics in Practice and Theory,2006,36(7):63-71. |
| |
| Authors: | HU Ya-feng HU Ai-jun WANG Yu-hang ZHANG Xian-da |
| |
| Abstract: | Based on the analysis of the air refueling mission,two recursive models for optimizing the schedule of airplanes are proposed in this paper.A heuristic algorithm is used to search for the solution.The algorithm is divided into two sub-algorithms, which are fit for the situations whether the service airplanes can fly once or more.The results show that the proposed models are highly efficient and easily realized in computers.It must be pointed out that the results are optimum for question 1 and question 2 under some conditions,and the results for other questions are approximate optimum solutions. |
| |
| Keywords: | air refueling recursive model heuristic algorithm search |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
