Using submodularity within column generation to solve the flight-to-gate assignment problem

In this paper, the authors provide a column generation-based approach for solving the airport flight-to-gate assignment problem, where the goal is to minimize the on-ground portion of arrival delays by optimally assigning each scheduled flight to a compatible gate. Specifically, the authors use a set covering formulation for the master problem and decompose the pricing problem such that each gate is the basis for an independent pricing problem to be solved for assignment patterns with negative reduced costs. The authors use a combination of an approximation algorithm based on the submodularity of the underlying set and dynamic programming algorithms to solve the independent pricing problems. To the best of the authors' knowledge, this is the first use of submodularity property to efficiently solve pricing problems and improve the performance of column generation algorithm. The authors show that the dynamic programming algorithm is pseudo-polynomial when there are integer inputs. The authors also design and employ a rolling horizon method and block decomposition algorithm to solve large-sized instances. Finally, the authors perform extensive computational experiments to validate the performance of their approach.

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01782760
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Sep 24 2021 10:20AM