基于最小成本的飞机着陆规划算法

Algorithm for Scheduling Aircraft Landing Based on Minimum Cost

在以往着陆规划中,较少考虑公司的成本。利用航班的成本函数,建立了满足着陆间隔、着陆时间段等约束的着陆规划模型,提出了一种使用局部搜索和线性规划的启发式算法。实例验算表明,所给模型及算法可以在合理的时间内求解大规模规划问题,有效地降低公司成本。

Airlines＇ costs were rarely taken into account in previous arrival planning. In this paper,by using cost functions of flights,a model is presented to schedule aircraft landings,which satisfies the landing intervals and separation constraints,and puts forward a heuristie algorithm by using local search and linear programming. Examples of checking computations show that this model and algorithm can solve problems of planning on a large scale within a reasonable period of time,thus effectively reducing a company＇s costs.