繁忙机场机位分配的混合集合规划方法研究-交通运输规划与管理专业论文.docxVIP

南京航空航天大学硕士学位论文 南京航空航天大学硕士学位论文 繁忙机场机位分配的混合集合规划方法研究 繁忙机场机位分配的混合集合规划方法研究 I I PAGE PAGE IV 摘 要 随着我国民航运输业的高速发展，航班量不断增加，繁忙机场停机位资源不足的问题日益 突出。停机位分配问题成为继跑道容量之后第二个制约繁忙机场发展的瓶颈。另外，繁忙机场 航班流量大，航班随机延误率较高，飞机在停机位上发生冲突的可能性也不容忽视。 本文首先以近机位利用率最大化为目标函数建立了繁忙机场机位分配的混合集合规划模 型，并设计相应的求解规则进行求解。针对繁忙机场停机坪上飞机间的冲突风险，本文分析了 冲突发生的情形，设计了同一机位前后航班间冲突风险值的计算模型，以近机位利用率最大化 为第一目标，以同一机位前后航班间冲突风险值最小化为第二目标，建立了基于冲突风险优化 的混合集合规划模型，并设计高效的求解规则进行求解。最后，以首都机场一天进出港航班计 划为实例进行机位分配问题的求解。实例分析表明，与人工分配方案相比，混合集合规划方法 得出的分配结果中近机位利用率提高了 26.51%。同时，在近机位利用率大幅提高的情况下，同 机位前后航班间的总冲突风险值也减少了 1.2 分钟。结果表明，混合集合规划方法可用于解决 繁忙机场实际运营中的机位分配问题，并能够有效兼顾繁忙机场的运行安全和运营效率。 关键词：繁忙机场，机位分配，混合集合规划，自然约束语言，冲突风险 ABSTRACT The lack of gates resource in busy airports has turned out to be a problem with the rapid development of civil aviation industry and the increasing amount of flights in China. The gate assignment problem has become another bottleneck which restricts busy airports’ development after the runway capacity problem. Meanwhile, the possibility that there are conflict risks at the same gate should never be neglected due to the higher delay rate in busy airports. In this paper, a Mixed Set Programming Model for gate assignment in busy airports is established with the goal to achieve a maximum utilization of gates, and corresponding solving rules are also designed. In view of conflict risk between different aircraft in apron of busy airports, this paper builds a computational model of conflict time between adjacent flights in the same stand in order to avoid conflict risk. On this basis, this paper builds a Mixed Set Programming Model based on conflict risk optimization, setting maximum utilization of gates as the prior optimization objective and the minimum conflict time of adjacent flights in a same stand as the second optimization objective. And an efficient solving rule is designed as well. Finally, the paper takes the flights in one day from Beijing Capital International Airport as an example to solve the gate assignment problem. The case analysis