基于拉格朗日松弛算法的终端区飞机排序研究 |
| |
引用本文: | 何昕,韩丹,蒋豪. 基于拉格朗日松弛算法的终端区飞机排序研究[J]. 航空计算技术, 2016, 0(3). DOI: 10.3969/j.issn.1671-654X.2016.03.001 |
| |
作者姓名: | 何昕 韩丹 蒋豪 |
| |
作者单位: | 1. 中国民用航空飞行学院 空中交通管理学院,四川 广汉618307;西南交通大学 交通运输与物流学院,四川 成都610031;2. 中国民用航空飞行学院 空中交通管理学院,四川 广汉,618307 |
| |
基金项目: | 2014年民航安全能力建设资金项目资助,2015年民航局科技创新引导项目资助(20150226) |
| |
摘 要: | 终端区飞机排序问题是减少航班延误、降低成本的关键技术.考虑机型运行成本和飞机总延误时间,建立一个0~1整数规划模型.因其是一个组合优化问题,多约束相互制约,采用拉格朗日松弛算法将复杂约束转换为线性约束进行求解.仿真结果表明,求得的进近队列延误小、延误成本低、无冲突,且拉格朗日松弛算法计算得到的结果更为可靠,符合实际运行需求,结果优于传统的启发式算法.
|
关 键 词: | 终端区 排序 拉格朗日松弛算法 |
Aircraft Sequencing in Terminal Area Based on Lagrangian Relaxation Algorithm |
| |
Abstract: | Aircraft sequencing in terminal area is the key technology for diminish delay and cost. Consid-ering the type of aircrafts'operation cost and the time of all aircrafts'flight time in teiminal area,a 0-1 in-teger programming model is established. This is a combination optimum question with mutlti-constraints. Then using langrangian relaxation algorithm to slove this problem, which can convert the complex con-straints into linear constraints. Simulation shows,with LR algorithm,a none-conflict with lower delay is reached and the calculated result is more reliable. Besides,LR algorithm can meet the application's needs in real-time and is batter than traditional heuristic algorithm. |
| |
Keywords: | tetminal sequencing Langrangian relaxation algorithm |
本文献已被 万方数据 等数据库收录! |
|