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

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS

卷:317

Article

Xu, Bo¹ 

[1] Univ Shanghai Sci & Technol, Sch Business, Shanghai 200093, Peoples R China

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

DOI  :  10.1016/j.cam.2016.11.043

来源: Elsevier

【 摘 要 】

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. (c) 2016 Elsevier B.V. All rights reserved.

【 授权许可】

Free