- 1、本文档共8页,可阅读全部内容。
- 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
《2016 A Semidefinite Relaxation for Air Traffic Flow Scheduling》.pdf
A Semidefinite Relaxation for
Air Traffic Flow Scheduling
Alexandre d’Aspremont∗ Laurent El Ghaoui†
September 26, 2006
Abstract
We first formulate the problem of optimally scheduling air traffic low with sector capacity constraints
as a mixed integer linear program. We then use semidefinite relaxation techniques to form a convex
relaxation of that problem. Finally, we present a randomization algorithm to further improve the quality
of the solution. Because of the specific structure of the air traffic flow problem, the relaxation has a
single semidefinite constraint of size dn where d is the maximum delay and n the number of flights.
1 Introduction
In this paper, given a schedule of flights and their routes we solve the problem of finding a new schedule
that satisfies a list of sector capacity constraints and minimizes the total delay compared to the original
scheduled. While the optimal routing problem with weather uncertainty and capacity constraints is essen-
tially intractable, [NEG05] show that robust optimal routing of a single aircraft under weather and traffic
uncertainty can be solved efficiently as a robust Markov dynamic programming (MDP) problem. So the
problem we solve here should be seen as a second phase: given the routes computed using MDP, our relax-
ation produces an optimal schedule, satisfying capacity constraints while minimizing the total delay. While
this scheduling problem is significantly simpler than the global routing problem, it still combinatorial (and
in fact NP-Hard), hence we need to formulate a relaxation to obtain approximate solutions efficiently. We
can interpret this problem as particular case of job shop scheduling problem where a task corresponds t
您可能关注的文档
- 《04_Web测试自动化_20160720》.pdf
- 《05 Interaction of A Cavitation Bubble and An Air Bubble with a Rigid Boundary 》.pdf
- 《07Catalog-accessories》.pdf
- 《09 The counter jet formation in an air bubble induced by the impact of shock waves》.pdf
- 《09老子道德经注(魏&王弼撰)》.pdf
- 《1 ANSYS分析过程》.pdf
- 《1-2 Words and Phrases Related to Air Travel》.ppt
- 《1-Air&CompressedAir-FundamentalTraining》.ppt
- 《1.0.InduSoft Web Studio V7.1体验-宜宾机电一体化-李卫》.pdf
- 《1.金宇传媒&互联网行业培训-分析框架和投资逻辑20160905(28页)》.ppt
最近下载
- 2025年全国新高考I卷高考全国一卷真题数学试卷(真题+答案).docx VIP
- 中国成人急性呼吸窘迫综合征(ARDS)诊断与非机械通气治疗指南(2023)解读PPT课件.pptx VIP
- 四年级下册英语教案Fun Time 2 Recycle 1人教精通版.pdf VIP
- 2025年安全生产月活动总结(编号5).pptx
- 东软集团股份有限公司2023-2024年招聘172人公开引进高层次人才笔试参考题库(共100题)答案.docx VIP
- 1+x水环境监测与治理(中级)测试题及参考答案.docx VIP
- 有趣的伯努利原理课件.ppt VIP
- 物业岗位操作规程及作业指导(完整版).docx VIP
- 普通高中历史课程标准(2017年版2020年修订).doc VIP
- 《普通高中历史课程标准(2017年版2020年修订)》新变化.docx VIP
文档评论(0)