{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T16:54:51Z","timestamp":1782924891431,"version":"3.54.5"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T00:00:00Z","timestamp":1777248000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T00:00:00Z","timestamp":1777248000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100015866","name":"Hezkuntza, Hizkuntza Politika Eta Kultura Saila, Eusko Jaurlaritza","doi-asserted-by":"publisher","award":["KK-2024\/00105"],"award-info":[{"award-number":["KK-2024\/00105"]}],"id":[{"id":"10.13039\/100015866","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Mach. Intell."],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s42484-026-00387-4","type":"journal-article","created":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T09:42:29Z","timestamp":1777282949000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimization of flight routes: quantum approximate optimization algorithm for the tail assignment problem"],"prefix":"10.1007","volume":"8","author":[{"given":"Marta","family":"Gili","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paul","family":"San Sebastian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ane","family":"Bl\u00e1zquez-Garc\u00eda","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,4,27]]},"reference":[{"issue":"7","key":"387_CR1","doi-asserted-by":"publisher","first-page":"7564","DOI":"10.1109\/TITS.2022.3172241","volume":"24","author":"U Azad","year":"2023","unstructured":"Azad U, Behera BK, Ahmed EA, Panigrahi PK, Farouk A (2023) Solving vehicle routing problem using quantum approximate optimization algorithm. IEEE Trans Intell Transp Syst 24(7):7564\u20137573","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"3","key":"387_CR2","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C Barnhart","year":"1998","unstructured":"Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MW, Vance PH (1998) Branch-and-price: Column generation for solving huge integer programs. Oper Res 46(3):316\u2013329","journal-title":"Oper Res"},{"key":"387_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2024.03.002","volume":"1068","author":"K Blekos","year":"2024","unstructured":"Blekos K, Brand D, Ceschini A, Chou C-H, Li R-H, Pandya K, Summer A (2024) A review on quantum approximate optimization algorithm and its variants. Phys Rep 1068:1\u201366","journal-title":"Phys Rep"},{"key":"387_CR4","doi-asserted-by":"crossref","unstructured":"Bucher D, Kraus N, Blenninger J, Lachner M, Stein J, Linnhoff-Popien C (2024) Towards Robust Benchmarking of Quantum Optimization Algorithms","DOI":"10.1109\/QCE60285.2024.11030870"},{"key":"387_CR5","unstructured":"Crooks GE (2018) Performance of the quantum approximate optimization algorithm on the maximum cut problem. arXiv:1811.08419"},{"issue":"3","key":"387_CR6","volume":"8","author":"S Endo","year":"2018","unstructured":"Endo S, Benjamin SC, Li Y (2018) Practical quantum error mitigation for near-future applications. Phys Rev X 8(3):031027","journal-title":"Phys Rev X"},{"key":"387_CR7","unstructured":"Farhi E, Harrow AW (2016) Quantum supremacy through the quantum approximate optimization algorithm. arXiv:1602.07674"},{"key":"387_CR8","unstructured":"Farhi E, Goldstone J, Gutmann S (2014) A quantum approximate optimization algorithm. arXiv:1411.4028"},{"key":"387_CR9","unstructured":"Farhi E, Gutmann S, Ranard D, Villalonga B (2025) Lower bounding the MaxCut of high girth 3-regular graphs using the QAOA. arXiv:2503.12789"},{"key":"387_CR10","unstructured":"Gr\u00f6nkvist M (2005) The tail assignment problem. Phd thesis, Chalmers University of Technology and G\u00f6teborg University"},{"key":"387_CR11","doi-asserted-by":"crossref","unstructured":"Hadfield S, Wang Z, O\u2019gorman B, Rieffel EG, Venturelli D, Biswas R (2019) From the quantum approximate optimization algorithm to a quantum alternating operator Ansatz. Algorithms 12(2):34","DOI":"10.3390\/a12020034"},{"key":"387_CR12","doi-asserted-by":"crossref","unstructured":"Martins LN, Rocha AP, Castro AJ (2021) A qubo model to the tail assignment problem. In: ICAART (2):899\u2013906","DOI":"10.5220\/0010259608990906"},{"issue":"1","key":"387_CR13","doi-asserted-by":"publisher","first-page":"4812","DOI":"10.1038\/s41467-018-07090-4","volume":"9","author":"JR McClean","year":"2018","unstructured":"McClean JR, Boixo S, Smelyanskiy VN, Babbush R, Neven H (2018) Barren plateaus in quantum neural network training landscapes. Nat Commun 9(1):4812","journal-title":"Nat Commun"},{"issue":"1","key":"387_CR14","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1038\/s41534-025-01082-1","volume":"11","author":"J Monta\u00f1ez-Barrera","year":"2025","unstructured":"Monta\u00f1ez-Barrera J, Michielsen K (2025) Toward a linear-ramp QAOA protocol: evidence of a scaling advantage in solving some combinatorial optimization problems. NPJ Quantum Information 11(1):131","journal-title":"NPJ Quantum Information"},{"key":"387_CR15","unstructured":"Montoito F (2016) Application of the simulated annealing with adaptive local neighborhood search to the tail assignment problem the case study of tap. PhD thesis, Master\u2019s thesis, Instituto Superior T\u00e9cnico, Universidade de Lisboa"},{"key":"387_CR16","doi-asserted-by":"crossref","unstructured":"Palackal L, Poggel B, Wulff M, Ehm H, Lorenz JM, Mendl CB (2023) Quantum-assisted solution paths for the capacitated vehicle routing problem. In: 2023 IEEE International Conference on Quantum Computing and Engineering (QCE), pp 648\u2013658. IEEE Computer Society, Los Alamitos, CA, USA","DOI":"10.1109\/QCE57702.2023.00080"},{"key":"387_CR17","doi-asserted-by":"publisher","first-page":"79","DOI":"10.22331\/q-2018-08-06-79","volume":"2","author":"J Preskill","year":"2018","unstructured":"Preskill J (2018) Quantum computing in the NISQ era and beyond. Quantum 2:79","journal-title":"Quantum"},{"issue":"1","key":"387_CR18","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1287\/trsc.2015.0664","volume":"51","author":"S Ruther","year":"2017","unstructured":"Ruther S, Boland N, Engineer FG, Evans I (2017) Integrated aircraft routing, crew pairing, and tail assignment: Branch-and-price with many pricing problems. Transp Sci 51(1):177\u2013195","journal-title":"Transp Sci"},{"issue":"22","key":"387_CR19","doi-asserted-by":"publisher","first-page":"6761","DOI":"10.1126\/sciadv.adm6761","volume":"10","author":"R Shaydulin","year":"2024","unstructured":"Shaydulin R, Li C, Chakrabarti S, DeCross M, Herman D, Kumar N, Larson J, Lykov D, Minssen P, Sun Y et al (2024) Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem. Sci Adv 10(22):6761","journal-title":"Sci Adv"},{"issue":"3","key":"387_CR20","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevApplied.20.034062","volume":"20","author":"M Svensson","year":"2023","unstructured":"Svensson M, Andersson M, Gr\u00f6nkvist M, Vikst\u00e5l P, Dubhashi D, Ferrini G, Johansson G (2023) Hybrid quantum-classical heuristic to solve large-scale integer linear programs. Phys Rev Appl 20(3):034062","journal-title":"Phys Rev Appl"},{"issue":"18","key":"387_CR21","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.119.180509","volume":"119","author":"K Temme","year":"2017","unstructured":"Temme K, Bravyi S, Gambetta JM (2017) Error mitigation for short-depth quantum circuits. Phys Rev Lett 119(18):180509","journal-title":"Phys Rev Lett"},{"issue":"3","key":"387_CR22","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevApplied.14.034009","volume":"14","author":"P Vikst\u00e5l","year":"2020","unstructured":"Vikst\u00e5l P, Gr\u00f6nkvist M, Svensson M, Andersson M, Johansson G, Ferrini G (2020) Applying the quantum approximate optimization algorithm to the tail-assignment problem. Phys Rev Appl 14(3):034009","journal-title":"Phys Rev Appl"},{"key":"387_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-020-02692-8","volume":"19","author":"M Willsch","year":"2020","unstructured":"Willsch M, Willsch D, Jin F, De Raedt H, Michielsen K (2020) Benchmarking the quantum approximate optimization algorithm. Quantum Inf Process 19:1\u201324","journal-title":"Quantum Inf Process"},{"key":"387_CR24","doi-asserted-by":"crossref","unstructured":"Willsch D, Willsch M, Calaza CDG, Jin F, De Raedt H, Svensson M, Michielsen K (2021) Benchmarking advantage and d-wave 2000q quantum annealers with exact cover problems. arXiv:2105.02208","DOI":"10.1007\/s11128-022-03476-y"},{"issue":"8","key":"387_CR25","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s11128-024-04497-5","volume":"23","author":"N Xie","year":"2024","unstructured":"Xie N, Lee X, Cai D, Saito Y, Asai N, Lau HC (2024) A feasibility-preserved quantum approximate solver for the Capacitated Vehicle Routing Problem. Quantum Inf Process 23(8):291","journal-title":"Quantum Inf Process"},{"issue":"10","key":"387_CR26","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6633\/ac8c54","volume":"85","author":"S Yarkoni","year":"2022","unstructured":"Yarkoni S, Raponi E, B\u00e4ck T, Schmitt S (2022) Quantum annealing for industry applications: Introduction and review. Rep Prog Phys 85(10):104001","journal-title":"Rep Prog Phys"},{"issue":"2","key":"387_CR27","volume":"10","author":"L Zhou","year":"2020","unstructured":"Zhou L, Wang S-T, Choi S, Pichler H, Lukin MD (2020) Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices. Phys Rev X 10(2):021067","journal-title":"Phys Rev X"}],"container-title":["Quantum Machine Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-026-00387-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42484-026-00387-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-026-00387-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T16:22:54Z","timestamp":1782922974000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42484-026-00387-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,27]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["387"],"URL":"https:\/\/doi.org\/10.1007\/s42484-026-00387-4","relation":{},"ISSN":["2524-4906","2524-4914"],"issn-type":[{"value":"2524-4906","type":"print"},{"value":"2524-4914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,27]]},"assertion":[{"value":"11 June 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"54"}}