{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T03:56:03Z","timestamp":1770522963245,"version":"3.49.0"},"reference-count":21,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T00:00:00Z","timestamp":1769644800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Qilu Normal University","award":["No. JG202235"],"award-info":[{"award-number":["No. JG202235"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>The Profitable Tour Problem is a well-known NP-hard optimization challenge central to tourism planning, aiming to maximize collected profit while minimizing travel costs. While classical heuristics provide approximate solutions, they often struggle with finding globally optimal routes. This paper explores the application of near-term quantum computing to this problem. We propose a framework based on the Variational Quantum Eigensolver to find high-quality solutions for the Profitable Tour Problem. The core of our contribution is a novel methodology for constructing a constraint-aware variational ansatz that directly encodes the problem\u2019s hard constraints. This approach circumvents the need for large penalty terms in the Hamiltonian problem, which are often a source of optimization challenges. We validate our method through numerical simulations on a representative tourism scenario of up to 25 qubits. The results demonstrate the viability of the approach, achieving high solution accuracy consistent with brute-force enumeration for smaller instances. This work serves as a proof-of-concept for applying Variational Quantum Eigensolver to complex tourism optimization problems and provides a basis for future exploration on real quantum hardware.<\/jats:p>","DOI":"10.3390\/e28020153","type":"journal-article","created":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T16:08:17Z","timestamp":1769702897000},"page":"153","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimizing Tourism Routes: A Quantum Approach to the Profitable Tour Problem"],"prefix":"10.3390","volume":"28","author":[{"given":"Xiao-Shuang","family":"Cheng","sequence":"first","affiliation":[{"name":"School of Geography and Tourism, Qilu Normal University, Jinan 250000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6518-2667","authenticated-orcid":false,"given":"You-Hang","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Artificial Intelligence, Aerospace Information Technology University, Jinan 250000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao-Hong","family":"Dong","sequence":"additional","affiliation":[{"name":"School of Geography and Tourism, Qilu Normal University, Jinan 250000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Geography and Tourism, Qilu Normal University, Jinan 250000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2026,1,29]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1002\/net.3230190602","article-title":"The prize collecting traveling salesman problem","volume":"19","author":"Balas","year":"1989","journal-title":"Networks"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1111\/itor.13039","article-title":"Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem","volume":"29","author":"Pantuza","year":"2022","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1687814017732309","DOI":"10.1177\/1687814017732309","article-title":"A tour route planning model for tourism experience utility maximization","volume":"9","author":"Wu","year":"2017","journal-title":"Adv. Mech. Eng."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/s10732-014-9242-5","article-title":"A survey on algorithmic approaches for solving tourist trip design problems","volume":"20","author":"Damianos","year":"2014","journal-title":"J. Heuristics"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1182","DOI":"10.1126\/science.abn7293","article-title":"Quantum advantage in learning from experiments","volume":"376","author":"Michael","year":"2022","journal-title":"Science"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"584","DOI":"10.1016\/j.egyr.2022.11.185","article-title":"Quantum computation in power systems: An overview of recent advances","volume":"9","author":"Golestan","year":"2023","journal-title":"Energy Rep."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"015004","DOI":"10.1103\/RevModPhys.94.015004","article-title":"Noisy intermediate-scale quantum algorithms","volume":"94","author":"Bharti","year":"2022","journal-title":"Rev. Mod. Phys."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1619","DOI":"10.1016\/j.joule.2024.03.020","article-title":"Opportunities for quantum computing within net-zero power system optimization","volume":"8","author":"Morstyn","year":"2024","journal-title":"Joule"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"291","DOI":"10.22331\/q-2020-07-06-291","article-title":"Option pricing using quantum computers","volume":"4","author":"Stamatopoulos","year":"2020","journal-title":"Quantum"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"025059","DOI":"10.1088\/2058-9565\/adbcd1","article-title":"Unified sparse optimization via quantum architectures and hybrid techniques","volume":"10","author":"Li","year":"2025","journal-title":"Quantum Sci. Technol."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"79","DOI":"10.22331\/q-2018-08-06-79","article-title":"Quantum Computing in the NISQ era and beyond","volume":"2","author":"Preskill","year":"2018","journal-title":"Quantum"},{"key":"ref_12","first-page":"1","article-title":"The variational quantum eigensolver: A review of methods and best practices","volume":"986","author":"Jules","year":"2022","journal-title":"Phys. Rep."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"4213","DOI":"10.1038\/ncomms5213","article-title":"A variational eigenvalue solver on a quantum processor","volume":"5","author":"Peruzzo","year":"2014","journal-title":"Nat. Commun."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1038\/s41534-019-0130-6","article-title":"Quantum risk analysis","volume":"5","author":"Woerner","year":"2019","journal-title":"NPJ Quantum Inf."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1038\/s42254-023-00603-1","article-title":"Quantum computing for finance","volume":"5","author":"Herman","year":"2023","journal-title":"Nat. Rev. Phys."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1772","DOI":"10.1587\/transinf.2023EDP7071","article-title":"Enhancing VQE Convergence for Optimization Problems with Problem-Specific Parameterized Quantum Circuits","volume":"11","author":"Matsuo","year":"2023","journal-title":"IEICE Trans. Inf. Syst."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"075345","DOI":"10.1063\/5.0241266","article-title":"Deterministic construction of arbitrary W states with quadratically increasing number of two-qubit gates","volume":"15","author":"Diker","year":"2025","journal-title":"AIP Adv."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"677","DOI":"10.22331\/q-2022-03-30-677","article-title":"General parameter-shift rules for quantum gradients","volume":"6","author":"David","year":"2022","journal-title":"Quantum"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"567","DOI":"10.22331\/q-2021-10-20-567","article-title":"Simultaneous Perturbation Stochastic Approximation of the Quantum Fisher Information","volume":"5","author":"Gacon","year":"2021","journal-title":"Quantum"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Ronghang, C., Zhou, G., Cong, G., Guanru, F., and Shi-Yao, H. (2024). Pure quantum gradient descent algorithm and full quantum variational eigensolver. Front. Phys., 19.","DOI":"10.1007\/s11467-023-1346-7"},{"key":"ref_21","unstructured":"Dou, M., Zou, T., Fang, Y., Wang, J., Zhao, D., Yu, L., Chen, B., Guo, W., Li, Y., and Chen, Z. (2022). QPanda: High-performance quantum computing framework for multiple application scenarios. arXiv."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/28\/2\/153\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T05:12:05Z","timestamp":1770441125000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/28\/2\/153"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,29]]},"references-count":21,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2026,2]]}},"alternative-id":["e28020153"],"URL":"https:\/\/doi.org\/10.3390\/e28020153","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,29]]}}}