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

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