不确定情况下的机群和机尾分配

IF 0.9 4区 数学 Q3 MATHEMATICS, APPLIED
Lukas Glomb, Frauke Liers, Florian Rösel
{"title":"不确定情况下的机群和机尾分配","authors":"Lukas Glomb,&nbsp;Frauke Liers,&nbsp;Florian Rösel","doi":"10.1016/j.disopt.2024.100836","DOIUrl":null,"url":null,"abstract":"<div><p>Airlines solve many different optimization problems and combine the resulting solutions to ensure smooth, minimum-cost operations. Crucial problems are the Fleet Assignment, which assigns aircraft types to flights of a given schedule, and the Tail Assignment, which determines individual flight sequences to be performed by single aircraft. In order to find a cost-optimal solution, many airlines use mathematical optimization models. For these to be effective, the available data and forecasts must reflect the situation as accurately as possible. However, especially in times of a pandemic, the underlying plan is subject to severe uncertainties: Staff and demand uncertainties can even lead to flight cancellations or result in entire aircraft having to be grounded. Therefore, it is advantageous for airlines to protect their mathematical models against uncertainties in the input parameters. In this work, two computational tractable and cost-efficient robust models and solution approaches are developed: First, we set up a novel mixed integer model for the integrated fleet and tail assignment, which ensures that as few subsequent flights as possible have to be canceled in the event of initial flight cancellations. We then solve this model using a procedure that ensures that the costs of the solution remain considerably low. Our second model is an extended fleet assignment model that allows us to compensate for entire aircraft cancellations in the best possible way, taking into account rescheduling options. We demonstrate the effectiveness of both approaches by conducting an extensive computational study based on real flight schedules of a major German airline. It turns out that both models deliver stable, cost-efficient solutions within less than ten minutes, which significantly reduce follow-up costs in the case uncertainties arise.</p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":"52 ","pages":"Article 100836"},"PeriodicalIF":0.9000,"publicationDate":"2024-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S157252862400015X/pdfft?md5=f80dbb301204008a3a9aff4b64f02673&pid=1-s2.0-S157252862400015X-main.pdf","citationCount":"0","resultStr":"{\"title\":\"Fleet & tail assignment under uncertainty\",\"authors\":\"Lukas Glomb,&nbsp;Frauke Liers,&nbsp;Florian Rösel\",\"doi\":\"10.1016/j.disopt.2024.100836\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Airlines solve many different optimization problems and combine the resulting solutions to ensure smooth, minimum-cost operations. Crucial problems are the Fleet Assignment, which assigns aircraft types to flights of a given schedule, and the Tail Assignment, which determines individual flight sequences to be performed by single aircraft. In order to find a cost-optimal solution, many airlines use mathematical optimization models. For these to be effective, the available data and forecasts must reflect the situation as accurately as possible. However, especially in times of a pandemic, the underlying plan is subject to severe uncertainties: Staff and demand uncertainties can even lead to flight cancellations or result in entire aircraft having to be grounded. Therefore, it is advantageous for airlines to protect their mathematical models against uncertainties in the input parameters. In this work, two computational tractable and cost-efficient robust models and solution approaches are developed: First, we set up a novel mixed integer model for the integrated fleet and tail assignment, which ensures that as few subsequent flights as possible have to be canceled in the event of initial flight cancellations. We then solve this model using a procedure that ensures that the costs of the solution remain considerably low. Our second model is an extended fleet assignment model that allows us to compensate for entire aircraft cancellations in the best possible way, taking into account rescheduling options. We demonstrate the effectiveness of both approaches by conducting an extensive computational study based on real flight schedules of a major German airline. It turns out that both models deliver stable, cost-efficient solutions within less than ten minutes, which significantly reduce follow-up costs in the case uncertainties arise.</p></div>\",\"PeriodicalId\":50571,\"journal\":{\"name\":\"Discrete Optimization\",\"volume\":\"52 \",\"pages\":\"Article 100836\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-03-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S157252862400015X/pdfft?md5=f80dbb301204008a3a9aff4b64f02673&pid=1-s2.0-S157252862400015X-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Optimization\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S157252862400015X\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Optimization","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S157252862400015X","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

摘要

航空公司要解决许多不同的优化问题,并将由此产生的解决方案结合起来,以确保平稳、最低成本的运营。其中最关键的问题是机队分配和尾翼分配,前者是将飞机机型分配给特定时刻表的航班,后者是确定单架飞机执行的单个航班序列。为了找到成本最优的解决方案,许多航空公司使用数学优化模型。要使这些模型有效,现有的数据和预测必须尽可能准确地反映情况。然而,特别是在大流行病时期,基本计划会受到严重不确定性的影响:人员和需求的不确定性甚至会导致航班取消或整架飞机停飞。因此,对航空公司来说,保护其数学模型免受输入参数不确定性的影响是非常有利的。在这项工作中,我们开发了两种可计算性强、成本效益高的稳健模型和求解方法:首先,我们为综合机队和机尾分配建立了一个新颖的混合整数模型,该模型可确保在初始航班取消的情况下,尽可能少地取消后续航班。然后,我们使用一种程序来求解这一模型,确保求解的成本保持在相当低的水平。我们的第二个模型是一个扩展的机队分配模型,它允许我们在考虑到重新安排选项的情况下,以最佳方式补偿整个飞机的取消。我们以德国一家大型航空公司的实际航班时刻表为基础,进行了广泛的计算研究,从而证明了这两种方法的有效性。结果表明,这两种模型都能在十分钟内提供稳定、具有成本效益的解决方案,从而在出现不确定因素时大大降低后续成本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Fleet & tail assignment under uncertainty

Airlines solve many different optimization problems and combine the resulting solutions to ensure smooth, minimum-cost operations. Crucial problems are the Fleet Assignment, which assigns aircraft types to flights of a given schedule, and the Tail Assignment, which determines individual flight sequences to be performed by single aircraft. In order to find a cost-optimal solution, many airlines use mathematical optimization models. For these to be effective, the available data and forecasts must reflect the situation as accurately as possible. However, especially in times of a pandemic, the underlying plan is subject to severe uncertainties: Staff and demand uncertainties can even lead to flight cancellations or result in entire aircraft having to be grounded. Therefore, it is advantageous for airlines to protect their mathematical models against uncertainties in the input parameters. In this work, two computational tractable and cost-efficient robust models and solution approaches are developed: First, we set up a novel mixed integer model for the integrated fleet and tail assignment, which ensures that as few subsequent flights as possible have to be canceled in the event of initial flight cancellations. We then solve this model using a procedure that ensures that the costs of the solution remain considerably low. Our second model is an extended fleet assignment model that allows us to compensate for entire aircraft cancellations in the best possible way, taking into account rescheduling options. We demonstrate the effectiveness of both approaches by conducting an extensive computational study based on real flight schedules of a major German airline. It turns out that both models deliver stable, cost-efficient solutions within less than ten minutes, which significantly reduce follow-up costs in the case uncertainties arise.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Discrete Optimization
Discrete Optimization 管理科学-应用数学
CiteScore
2.10
自引率
9.10%
发文量
30
审稿时长
>12 weeks
期刊介绍: Discrete Optimization publishes research papers on the mathematical, computational and applied aspects of all areas of integer programming and combinatorial optimization. In addition to reports on mathematical results pertinent to discrete optimization, the journal welcomes submissions on algorithmic developments, computational experiments, and novel applications (in particular, large-scale and real-time applications). The journal also publishes clearly labelled surveys, reviews, short notes, and open problems. Manuscripts submitted for possible publication to Discrete Optimization should report on original research, should not have been previously published, and should not be under consideration for publication by any other journal.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信