An efficient algorithm based on sparse optimization for the aircraft departure scheduling problem

作者：Ma, Weimin; Xu, Bo^*; Liu, Ming; Huang, Hui

来源：COMPUTATIONAL & APPLIED MATHEMATICS, 2016, 35(2): 371-387.

DOI：10.1007/s40314-014-0195-y

• Aircraft scheduling problem
• Sparse optimization
• Ant colony
• MIP

The aircraft departure scheduling problem (ASP) is a salient problem in the airports' runway control system, which proves to be nondeterministic polynomial hard. This paper formulates the ASP in the form of a permutation problem and proposes a new approximation algorithm based on sparse optimization to solve it. Then the numerical study is conducted, which validates that this new approximation algorithm has much better performance than ant colony and CPLEX. After that, we consider the ASP in real-time scenario, where the performance of this new algorithm is also good. Finally, some conclusions are summarized, and the future research directions are pointed out.

• 出版日期2016-7
• 单位同济大学