Hybrid Quantum Computing - Tabu Search Algorithm for Partitioning Problems: Preliminary Study on the Traveling Salesman Problem

Simple item page
dc.contributor.authorOsaba, Eneko
dc.contributor.authorVillar-Rodriguez, Esther
dc.contributor.authorOregi, Izaskun
dc.contributor.authorMoreno-Fernandez-de-Leceta, Aitor
dc.contributor.institutionQuantum
dc.date.accessioned2024-07-24T11:56:12Z
dc.date.available2024-07-24T11:56:12Z
dc.date.issued2021
dc.descriptionPublisher Copyright: © 2021 IEEE
dc.description.abstractQuantum Computing is considered as the next frontier in computing, and it is attracting a lot of attention from the current scientific community. This kind of computation provides to researchers with a revolutionary paradigm for addressing complex optimization problems, offering a significant speed advantage and an efficient search ability. Anyway, Quantum Computing is still in an incipient stage of development. For this reason, present architectures show certain limitations, which have motivated the carrying out of this paper. In this paper, we introduce a novel solving scheme coined as hybrid Quantum Computing - Tabu Search Algorithm. Main pillars of operation of the proposed method are a greater control over the access to quantum resources, and a considerable reduction of nonprofitable accesses. To assess the quality of our method, we have used 7 different Traveling Salesman Problem instances as benchmarking set. The obtained outcomes support the preliminary conclusion that our algorithm is an approach which offers promising results for solving partitioning problems while it drastically reduces the access to quantum computing resources. We also contribute to the field of Transfer Optimization by developing an evolutionary multiform multitasking algorithm as initialization method.en
dc.description.sponsorshipEneko Osaba, Esther Villar-Rodriguez and Izaskun Oregui would like to thank the Basque Government for its funding support through the EMAITEK and ELKARTEK (through QUANTEK project) programs.
dc.description.statusPeer reviewed
dc.format.extent8
dc.identifier.citationOsaba , E , Villar-Rodriguez , E , Oregi , I & Moreno-Fernandez-de-Leceta , A 2021 , Hybrid Quantum Computing - Tabu Search Algorithm for Partitioning Problems : Preliminary Study on the Traveling Salesman Problem . in 2021 IEEE Congress on Evolutionary Computation, CEC 2021 - Proceedings . 2021 IEEE Congress on Evolutionary Computation, CEC 2021 - Proceedings , Institute of Electrical and Electronics Engineers Inc. , pp. 351-358 , 2021 IEEE Congress on Evolutionary Computation, CEC 2021 , Virtual, Krakow , Poland , 28/06/21 . https://doi.org/10.1109/CEC45853.2021.9504923
dc.identifier.citationconference
dc.identifier.doi10.1109/CEC45853.2021.9504923
dc.identifier.isbn9781728183923
dc.identifier.urihttps://hdl.handle.net/11556/2599
dc.identifier.urlhttp://www.scopus.com/inward/record.url?scp=85124579190&partnerID=8YFLogxK
dc.language.isoeng
dc.publisherInstitute of Electrical and Electronics Engineers Inc.
dc.relation.ispartof2021 IEEE Congress on Evolutionary Computation, CEC 2021 - Proceedings
dc.relation.ispartofseries2021 IEEE Congress on Evolutionary Computation, CEC 2021 - Proceedings
dc.relation.projectIDEusko Jaurlaritza
dc.rightsinfo:eu-repo/semantics/openAccess
dc.subject.keywordsDWAVE
dc.subject.keywordsMetaheuristic optimization
dc.subject.keywordsQuantum computing
dc.subject.keywordsTransfer optimization
dc.subject.keywordsTraveling salesman problem
dc.subject.keywordsModeling and Simulation
dc.subject.keywordsComputational Mathematics
dc.titleHybrid Quantum Computing - Tabu Search Algorithm for Partitioning Problems: Preliminary Study on the Traveling Salesman Problemen
dc.typeconference output
Files