{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T04:26:21Z","timestamp":1785471981518,"version":"3.56.0"},"reference-count":74,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"European Union under the REFRESH-Research Excellence For REgion Sustainability and High-tech Industries Project via the Operational Programme Just Transition","award":["CZ.10.03.01\/00\/22_003\/0000048"],"award-info":[{"award-number":["CZ.10.03.01\/00\/22_003\/0000048"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/access.2025.3554690","type":"journal-article","created":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:47:44Z","timestamp":1742975264000},"page":"54223-54239","source":"Crossref","is-referenced-by-count":4,"title":["Evolutionary Algorithm for the Traveling Salesman Problem With Innovative Encoding on Hybrid Quantum-Classical Machines"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0219-3590","authenticated-orcid":false,"given":"Ravi","family":"Saini","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, ASET, Amity University, Noida, Uttar Pradesh, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2312-1185","authenticated-orcid":false,"given":"Ashish","family":"Mani","sequence":"additional","affiliation":[{"name":"Amity Innovation and Design Centre, Amity University, Noida, Uttar Pradesh, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M. S.","family":"Prasad","sequence":"additional","affiliation":[{"name":"Amity Institute of Space Science and Technology, Amity University, Noida, Uttar Pradesh, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0360-7919","authenticated-orcid":false,"given":"Siddhartha","family":"Bhattacharyya","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering and Computer Science, VŠB-Technical University of Ostrava, Ostrava, Czech Republic"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8481-0136","authenticated-orcid":false,"given":"Jan","family":"Platos","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering and Computer Science, VŠB-Technical University of Ostrava, Ostrava, Czech Republic"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1023\/a:1006529012972"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(77)90012-3"},{"key":"ref3","first-page":"93","article-title":"History of TSP computation","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"Applegate","year":"2006"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110908"},{"issue":"1","key":"ref5","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","article-title":"No free lunch theorems for optimization","volume":"1","author":"Wolpert","year":"1997","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.54254\/2753-8818\/28\/20230393"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.hm.2020.04.003"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s11831-017-9247-y"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/b978-0-12-819714-1.00020-8"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45078-8_27"},{"key":"ref11","doi-asserted-by":"crossref","DOI":"10.1002\/9780470496916","volume-title":"Metaheuristics: From Design to Implementation","author":"Talbi","year":"2009"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-020-09906-6"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1665-5"},{"key":"ref14","volume-title":"The Traveling Salesman Problem and Its Variations","volume":"12","author":"Gutin","year":"2006"},{"key":"ref15","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198854227.001.0001","volume-title":"Quantum Mechanics for Beginners: With Applications to Quantum Communication and Quantum Computing","author":"Zubairy","year":"2020"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/bf01886518"},{"issue":"1818","key":"ref17","first-page":"97","article-title":"Quantum theory, the church-turing principle and the universal quantum computer","volume":"A400","author":"Deutsch","year":"1985","journal-title":"Proc. Roy. Soc. London. A. Math. Phys. Sci."},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/sfcs.1994.365700"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.80.4329"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.22331\/q-2018-08-06-79"},{"key":"ref21","article-title":"Hybrid quantum-classical algorithms","author":"Campos","year":"2024","journal-title":"arXiv:2406.12371"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2008.09.006"},{"issue":"3","key":"ref23","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1016\/j.ejor.2023.07.022","article-title":"A comprehensive survey on the generalized traveling salesman problem","volume":"314","author":"Pop","year":"2024","journal-title":"Eur. J. Oper. Res."},{"issue":"12","key":"ref24","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1038\/s42254-024-00770-9","article-title":"Challenges and opportunities in quantum optimization","volume":"6","author":"Abbas","year":"2024","journal-title":"Nature Rev. Phys."},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1201\/9781003283294"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s12065-022-00783-2"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3177790"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1016\/j.ins.2021.06.049","article-title":"Implementing evolutionary optimization on actual quantum processors","volume":"575","author":"Acampora","year":"2021","journal-title":"Inf. Sci."},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2002.804320"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2008.2003010"},{"key":"ref31","doi-asserted-by":"crossref","DOI":"10.1155\/2014\/976202","article-title":"Effect of population structures on quantum-inspired evolutionary algorithm","volume-title":"Applied Computational Intelligence and Soft Computing","author":"Mani","year":"2014"},{"issue":"7779","key":"ref32","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1038\/s41586-019-1666-5","article-title":"Quantum supremacy using a programmable superconducting processor","volume":"574","author":"Arute","year":"2019","journal-title":"Nature"},{"issue":"4","key":"ref33","first-page":"1573","article-title":"Quantum-inspired evolutionary algorithms on IBM quantum experience","volume":"29","author":"Rubio","year":"2021","journal-title":"Eng. Lett."},{"key":"ref34","first-page":"416","article-title":"Quantum-inspired estimation of distribution algorithm to solve the travelling salesman problem","volume-title":"Proc. IEEE Congr. Evol. Comput. (CEC)","author":"Soloviev"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/CEC45853.2021.9504923"},{"key":"ref36","article-title":"A quantum approximate optimization algorithm","author":"Farhi","year":"2014","journal-title":"arXiv:1411.4028"},{"key":"ref37","article-title":"Efficient quantum algorithm for solving travelling salesman problem: An IBM quantum experience","author":"Srinivasan","year":"2018","journal-title":"arXiv:1805.10928"},{"key":"ref38","article-title":"Quantum computing with qiskit","author":"Javadi-Abhari","year":"2024","journal-title":"arXiv:2405.08810"},{"key":"ref39","article-title":"Solving the traveling salesperson problem with quantum approximate optimization algorithms","author":"Chander","year":"2024","journal-title":"Preprint"},{"key":"ref40","article-title":"A novel approach for solving constrained optimization problems with QAOA using encoders","author":"Mete","year":"2022"},{"key":"ref41","article-title":"From quantum graph computing to quantum graph learning: A survey","author":"Tang","year":"2022","journal-title":"arXiv:2202.09506"},{"key":"ref42","volume-title":"A Quantum Phase Estimation Approach to the Traveling Salesman Problem","author":"Pattabi","year":"2019"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.3390\/e25081238"},{"issue":"2","key":"ref44","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1007\/s00521-022-07438-4","article-title":"An investigation of IBM quantum computing device performance on combinatorial optimisation problems","volume":"37","author":"Khumalo","year":"2025","journal-title":"Neural Comput. Appl."},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.3389\/fphy.2014.00005"},{"key":"ref46","article-title":"The D-wave advantage system: An overview","author":"McGeoch","year":"2020"},{"key":"ref47","volume-title":"IBM Unveils Breakthrough 127-Qubit Quantum Processor","author":"Collins","year":"2021"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.3389\/fphy.2021.760783"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/SSCI51031.2022.10022300"},{"key":"ref50","first-page":"1954","article-title":"Benchmarks for digital annealer with quadratic constrained binary optimization problems","volume-title":"Proc. Genetic Evol. Comput. Conf. Companion","author":"Kameyama"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/access.2024.3455436"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/mspec.2018.8389173"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/3700874"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.2021.0417"},{"key":"ref55","volume-title":"IBM Quantum Experience","year":"2024"},{"key":"ref56","volume-title":"Amazon Braket: Explore and Experiment With Quantum Computing","year":"2020"},{"key":"ref57","volume-title":"Pulse code communication","author":"Gray","year":"1953"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/icec.1994.349897"},{"key":"ref59","article-title":"The traveling salesman problem domain application of a fundamentally new approach to utilizing genetic algorithms","author":"Llid","year":"1991"},{"key":"ref60","first-page":"1","article-title":"A new approach using binary encoding to solve traveling salesman problem with genetic algorithms","volume":"20","author":"Aytekin","year":"2010","journal-title":"Algorithms"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2017.12.003"},{"key":"ref62","first-page":"1573","article-title":"The gray code","volume":"13","author":"Doran","year":"2007","journal-title":"Dept. Comput. Sci., J. Universal Comput. Sci., Univ. Auckland"},{"key":"ref63","volume-title":"Advanced Data Structures: Theory and Applications","author":"Suman","year":"2019"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1002\/int.22494"},{"issue":"1","key":"ref65","doi-asserted-by":"crossref","first-page":"16","DOI":"10.61963\/jaa.v1i1.47","article-title":"Quantum-inspired genetic algorithms for combinatorial optimization problems","volume":"1","author":"Mansori","year":"2023","journal-title":"Algorithm Asynchronous"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100777"},{"key":"ref67","article-title":"Solving combinatorial optimization problems with quantum inspired evolutionary algorithm tuned using a novel heuristic method","author":"Mani","year":"2016","journal-title":"arXiv:1612.08109"},{"key":"ref68","volume-title":"Taguchi Methods: Applications in World Industry","author":"Bendell","year":"1989"},{"key":"ref69","volume-title":"Design of Experiments Using the Taguchi Approach","author":"Roy","year":"2022"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1016\/j.mspro.2014.07.104"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2017.0791"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.4.376"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1145\/321105.321111"},{"key":"ref74","volume-title":"QIEDA: Quantum-Inspired Estimation of Distribution Algorithm","author":"Soloviev","year":"2021"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10820123\/10938601.pdf?arnumber=10938601","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T00:21:26Z","timestamp":1743639686000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10938601\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":74,"URL":"https:\/\/doi.org\/10.1109\/access.2025.3554690","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}