An optimization model for sample day selection in NAS-wide modeling studies

Feng Cheng, J. Gulding, B. Baszczewski, R. Galaviz
{"title":"An optimization model for sample day selection in NAS-wide modeling studies","authors":"Feng Cheng, J. Gulding, B. Baszczewski, R. Galaviz","doi":"10.1109/ICNSURV.2011.5935341","DOIUrl":null,"url":null,"abstract":"Future flight Schedules are generated based on air traffic demand forecast for the purpose of aviation planning and performance analysis studies. A selection process needs to be designed and implemented by sampling historical operational data for each fiscal quarter and choosing representative days that best reflect seasonality in terms of a given set of performance metrics. We propose an optimization based solution method for the sample day selection problem, which is formulated as a Mixed Integer Program (MIP). The objective of the MIP is to minimize the weighted difference between the true population and the sample to be selected in terms of the defined metrics subject to a set of constraints including the sample size limit, coverage requirements and other desired properties. An efficient solution algorithm has been implemented using the CPLEX MIP solver. Experiments have been conducted with a wide range of flight data from the recent years. The results from the MIP method provided robust solutions for the sample day selection problem. It is also shown that the method is quite flexible to incorporate additional constraints based on expert knowledge.","PeriodicalId":263977,"journal":{"name":"2011 Integrated Communications, Navigation, and Surveillance Conference Proceedings","volume":"118 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Integrated Communications, Navigation, and Surveillance Conference Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNSURV.2011.5935341","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Future flight Schedules are generated based on air traffic demand forecast for the purpose of aviation planning and performance analysis studies. A selection process needs to be designed and implemented by sampling historical operational data for each fiscal quarter and choosing representative days that best reflect seasonality in terms of a given set of performance metrics. We propose an optimization based solution method for the sample day selection problem, which is formulated as a Mixed Integer Program (MIP). The objective of the MIP is to minimize the weighted difference between the true population and the sample to be selected in terms of the defined metrics subject to a set of constraints including the sample size limit, coverage requirements and other desired properties. An efficient solution algorithm has been implemented using the CPLEX MIP solver. Experiments have been conducted with a wide range of flight data from the recent years. The results from the MIP method provided robust solutions for the sample day selection problem. It is also shown that the method is quite flexible to incorporate additional constraints based on expert knowledge.
全国范围内建模研究中样本日选择的优化模型
未来的航班时刻表是根据航空交通需求预测生成的,用于航空规划和性能分析研究。选择过程需要通过对每个财政季度的历史运营数据进行抽样,并根据给定的一组绩效指标选择最能反映季节性的代表性日期来设计和实施。我们提出了一种基于优化的样本日选择问题的求解方法,该方法被表述为混合整数规划(MIP)。MIP的目标是在一系列约束条件(包括样本量限制、覆盖范围要求和其他期望属性)的约束下,根据已定义的指标,将真实总体与待选样本之间的加权差异最小化。利用CPLEX MIP求解器实现了一种高效的求解算法。近年来,人们利用广泛的飞行数据进行了实验。MIP方法的结果为样本日选择问题提供了鲁棒解。该方法在引入基于专家知识的附加约束方面具有很大的灵活性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信