Flight Gate Assignment with a Quantum Annealer
- 734 Downloads
Optimal flight gate assignment is a highly relevant optimization problem from airport management. Among others, an important goal is the minimization of the total transit time of the passengers. The corresponding objective function is quadratic in the binary decision variables encoding the flight-to-gate assignment. Hence, it is a quadratic assignment problem being hard to solve in general. In this work we investigate the solvability of this problem with a D-Wave quantum annealer. These machines are optimizers for quadratic unconstrained optimization problems (QUBO). Therefore the flight gate assignment problem seems to be well suited for these machines. We use real world data from a mid-sized German airport as well as simulation based data to extract typical instances small enough to be amenable to the D-Wave machine. In order to mitigate precision problems, we employ bin packing on the passenger numbers to reduce the precision requirements of the extracted instances. We find that, for the instances we investigated, the bin packing has little effect on the solution quality. Hence, we were able to solve small problem instances extracted from real data with the D-Wave 2000Q quantum annealer.
KeywordsQuadratic assignment problem Quantum annealing QUBO Airport planning
The authors would like to thank NASA Ames Quantum Artificial Intelligence Laboratory for their support during performing the experiments on the D-Wave 2000Q system, for many valuable discussions and the opportunity to use the D-Wave 2000Q machine at NASA Ames.
- 2.Cai, J., Macready, W.G., Roy, A.: A practical heuristic for finding graph minors. arXiv preprint, June 2014. http://arxiv.org/abs/1406.2741
- 3.Classen, A.B., Rudolph, F.: Proactive passenger management with a total airport management perspective. In: Transportation Research Forum - TRF 2015, pp. 1–19, März 2015. https://elib.dlr.de/96079/
- 4.Do, T.T.T.M., et al.: A hybrid quantum-classical approach to solving scheduling problems. In: Ninth Annual Symposium on Combinatorial Search (2016)Google Scholar
- 5.Garey, M.R., Johnson, D.S.: Computers and Intractability, vol. 29. WH Freeman, New York (2002)Google Scholar
- 6.Gleixner, A., et al.: The SCIP optimization suite 5.0. Technical report, Optimization Online, December 2017. http://www.optimization-online.org/DB_HTML/2017/12/6385.html
- 7.Haghani, A., Chen, M.C.: Optimizing gate assignments at airport terminals. Transp. Res. Part A: Policy Pract. 32(6), 437–454 (1998)Google Scholar
- 9.Jung, M., Classen, A.B., Rudolph, F., Pick, A., Noyer, U.: Simulating a multi-airport region to foster individual door-to-door travel. In: Winter Simulation Conference, pp. 2518–2529. IEEE (2017). https://doi.org/10.1109/WSC.2017.8247980
- 11.Kügel, A.: Improved exact solver for the weighted max-sat problem. Pos@ sat 8, 15–27 (2010). https://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.190/Mitarbeiter/kuegel/maxsat.pdf
- 13.McGeoch, C.C., Wang, C.: Experimental evaluation of an adiabiatic quantum system for combinatorial optimization. In: Proceedings of the ACM International Conference on Computing Frontiers, p. 23. ACM (2013)Google Scholar
- 15.Stollenwerk, T., et al.: Quantum annealing applied to de-conflicting optimal trajectories for air traffic management. arXiv preprint (2017). https://arxiv.org/abs/1711.04889
- 16.Venturelli, D., Marchand, D.J.J., Rojo, G.: Quantum annealing implementation of job-shop scheduling. arXiv preprint, June 2015. http://arxiv.org/abs/1506.08479