登机口分配的混合模型及实现
Airport Gate Assignment A Hybrid Model and Implementation
摘要：
随着航空公司的快速发展，今天的机场变得比以前更加繁忙和复杂。在航空公司的日常运营中，如何根据航班时刻表为到达航班分配停机位是一个非常重要的问题，这促使研究人员采用各种先进的组合优化技术来研究和解决机场停机位分配问题（Airport Gate Assignment Problems，AGAP）。本文研究了AGAP问题，提出了一种基于约束规划和0 - 1混合整数规划的混合数学模型。以最小化任意两个相邻飞机分配到同一登机口的登机口冲突次数为目标，建立了一个带有逻辑约束和二元约束的数学模型。出于实际考虑，该模型的潜在目标也是最大限度地减少航空公司必须租赁或购买的登机口数量，以便顺利运营业务。最后，利用最优化程序设计语言（OPL）实现了该模型，并以美国大陆航空公司休斯顿乔治布什洲际机场IAH航班时刻表数据为例进行了实证研究，结果表明，该模型能够为航空公司提供一个有效的评价标准，以评估其当前停机位分配的效率。
英文摘要：
With the rapid development of airlines, airports today become much busier and more complicated than previous days. During airlines daily operations, assigning the available gates to the arriving aircrafts based on the fixed schedule is a very important issue, which motivates researchers to study and solve Airport Gate Assignment Problems (AGAP) with all kinds of state-of-the-art combinatorial optimization techniques. In this paper, we study the AGAP and propose a novel hybrid mathematical model based on the method of constraint programming and 0 - 1 mixed-integer programming. With the objective to minimize the number of gate conflicts of any two adjacent aircrafts assigned to the same gate, we build a mathematical model with logical constraints and the binary constraints. For practical considerations, the potential objective of the model is also to minimize the number of gates that airlines must lease or purchase in order to run their business smoothly. We implement the model in the Optimization Programming Language (OPL) and carry out empirical studies with the data obtained from online timetable of Continental Airlines, Houston Gorge Bush Intercontinental Airport IAH, which demonstrate that our model can provide an efficient evaluation criteria for the airline companies to estimate the efficiency of their current gate assignments.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
