An efficient Ant Colony algorithm based on wake-vortex modeling method for aircraft scheduling problem

作者:

Highlights:

摘要

The aircraft scheduling problem (ASP) is a salient problem in airport runway scheduling system. This paper originally proposes an Ant Colony (AC) algorithm based on the wake-vortex modeling (WVM) method for ASP. Numerical results validate that this new method has better performance than CPLEX, general AC algorithm, and approximation algorithm in Ma et al. (2014). It is a promising method to improve the efficiency of the aircraft scheduling system from a theoretical standpoint.

论文关键词:Aircraft scheduling problem,WVM,Rank 2 matrix approximation,Mixed-integer programming

论文评审过程:Received 17 August 2016, Revised 21 November 2016, Available online 7 December 2016, Version of Record 20 December 2016.

论文官网地址:https://doi.org/10.1016/j.cam.2016.11.043