复合类别航站楼分配问题的改进和声搜索算法

随着航空运输业的蓬勃发展,如何在硬件条件受限的情况下尽量提高机场的运行效率来满足日益增长的航班起降需求,日益受到关注.为了对机场航站楼登机门分配问题进一步优化,提出一种考虑登机门复合类别的航站楼分配问题,并建立数学模型,描述在航线类别、班机型号以及最短停靠间隔对于登机门选取的约束下,带有临时停机坪辅助的登机门分配优化问题.在模型经过精确算法验证的基础上,为适应登机门问题特性并求解中大规模问题,首次引进和声搜索算法,增加复杂约束条件,对编码解码、初始解产生以及寻优过程进行改进,提出一种更高效的改进和声搜索算法对模型进行求解.通过使用Lingo软件和Matlab软件对中小规模算例分别进行精确求解和智能算法求解,对比表明所提出智能算法的有效性、全局搜索能力以及求解效率.再通过对大规模问题的求解,表明所提出算法在现有条件下能够减小转机旅客的总转机路程,取得了较好的效果.

Solving composite airport gate allocation problem with improved harmony search

The development of air transport industry can not be separated from the support of airports. How to improve the operation efficiency of airports to meet the increasing demand of flight takeoff and landing under the limited hardware conditions has attracted more and more attention. In order to further optimize the allocation of airport gates in airport terminal buildings, this paper presents a model of airport gate allocation considering the composite categories of airport gates. The model describes the optimization of airport gate allocation with apron assistance under the constraints of airline type, flight type and minimum parking interval. Based on the accurate algorithm validation of the model, a more efficient improved harmony search algorithm is proposed to solve the model. In order to adapt to the characteristics of the medium and large scale problems, the improved harmony search algorithm is introduced by adding complex constraints, with improvements on encoding and decoding, and the initial solution generation and optimization process with. By using Lingo and Matlab respectively on small-scale and medium-scale examples, the result shows that the proposed improved harmony search algorithm is more effective and has advantages over the accurate algorithm in global search ability and solution efficiency. By solving large-scale problems, the proposed algorithm reduces the total transit distance of passengers and achieves good results under the condition of guaranteeing the utilization efficiency of the airport gates.