检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]南京航空航天大学民航学院,江苏南京210016
出 处:《西南交通大学学报》2010年第2期261-267,共7页Journal of Southwest Jiaotong University
基 金:国家863计划重点项目(2006AA12A105)
摘 要:为解决机场和定位点动态容量条件下的航班进离场流量优化分配问题,以总航班延误损失为决策依据,建立了绝对鲁棒优化模型、偏差鲁棒优化模型和相对鲁棒优化模型,并用捕食搜索算法,设计了寻找鲁棒最优解的算法流程.以国内某机场数据为例进行仿真验证,结果表明,得到的鲁棒最优解能够根据不同偏好有效规避风险,与该终端区一般容量条件下最优解的航班延误损失相比,偏差鲁棒最优策略和相对鲁棒最优策略下的航班延误损失分别减少了8.2%和7.8%.To optimize the allocation of aircraft arrival and departure flow under dynamic capacity of airports and fixes,an absolute robust optimization model,a deviation robust optimization model,and a relative robust optimization model were built,where the objective function is to minimize the total cost of delayed flights.Then,a solution process based on predatory search algorithm was developed to solve the robust optimization problems.A case study regarding the operation of one of Chinese airports was performed to verify the models.The simulation results show that the robust optimal solutions produced from these models could effectively avoid risks on the basis of different decision preferences in actual operations;compared with the optimal solution under the capacity of terminal area with common conditions,the strategy of deviation robust optimization could reduce the delay cost by 8.2%,and the strategy of relative robust optimization could reduce the delay cost by 7.8%.
关 键 词:空中交通管理 流量分配 鲁棒优化 捕食搜索算法 动态容量
分 类 号:V355.1[航空宇航科学与技术—人机与环境工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222