一种停机位分配问题的网络流数学模型

Network Flow Model and Algorithm of Gate Assignment

停机位分配问题是机场管理者经常需要解决的问题,分配要同时兼顾机场和乘客的利益,同时能提供突发事件的缓冲区。采用二值整数多商品流网络模型,提出以燃油消耗成本和乘客行走距离最小的停机位分配模型。实验结果表明,本模型可以应用到大规模问题的计算,同时采用将停机位划分子区域的启发式方法能加速模型的求解。

Gate assignment is a problem that the airport managers often need to solve. For the interests of the airport and passengers, assignment provides emergency buffer. Binary in- teger multi-commodity flow network model is used in this article, to put foward the gate as- signment program based on the cost of fuel consumption and passengers walking the shortest distance. This algorithm is computationally more efficient.