Flight Gate Allocation Problem Using Hybrid Quantum Solver

The paper aims to optimize the flight gate allocation problem to ensure maximum utilization of limited number of gates at an airport for a large number of flights. Taking all these variables in consideration and formulating an allocation strategy makes allocation complex, which is why most algorithms consider only one or two of the heuristics for problem formulation and deal with others such as emergencies and changes in real time. These types of allocation problems are usually cast as a graph coloring problem and the most optimum solution yields the desired configuration/allocation. There are classical algorithms that can solve this problem for smaller number of gates and flight combinations. However, as these numbers increase, the computation time for finding the optimum solution increases significantly. The classical algorithms that approach the problem are Genetic algorithm, Greedy algorithm and Backtracking algorithm.