An adaptive large neighborhood search heuristic for solving a robust gate assignment problem

作者：

Highlights：

• Robust gate assignment problem with transfer passengers and tows is considered.

• A large neighborhood search heuristic is proposed to solve the integrated problem.

• Extensive experiments are conducted to justify the performance of our approach.

摘要

•Robust gate assignment problem with transfer passengers and tows is considered.•A large neighborhood search heuristic is proposed to solve the integrated problem.•Extensive experiments are conducted to justify the performance of our approach.

论文关键词：Gate assignment problem,Robustness,Large neighborhood search,Heuristics

论文评审过程：Received 20 November 2016, Revised 24 April 2017, Accepted 25 April 2017, Available online 3 May 2017, Version of Record 11 May 2017.

论文官网地址：https://doi.org/10.1016/j.eswa.2017.04.050