<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1405-5546</journal-id>
<journal-title><![CDATA[Computación y Sistemas]]></journal-title>
<abbrev-journal-title><![CDATA[Comp. y Sist.]]></abbrev-journal-title>
<issn>1405-5546</issn>
<publisher>
<publisher-name><![CDATA[Instituto Politécnico Nacional, Centro de Investigación en Computación]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1405-55462022000200725</article-id>
<article-id pub-id-type="doi">10.13053/cys-26-2-4253</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Hybrid Quantum Genetic Algorithm for the 0-1 Knapsack Problem in the IBM Qiskit Simulator]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Ballinas]]></surname>
<given-names><![CDATA[Enrique]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Montiel]]></surname>
<given-names><![CDATA[Óscar]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Instituto Politécnico Nacional Centro de Investigación y Desarrollo en Tecnología Digital ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>06</month>
<year>2022</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>06</month>
<year>2022</year>
</pub-date>
<volume>26</volume>
<numero>2</numero>
<fpage>725</fpage>
<lpage>742</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462022000200725&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1405-55462022000200725&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1405-55462022000200725&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract: In this work, a novel Hybrid Quantum Genetic Algorithm (HQGA) for the 0-1 Knapsack Problem (KP) is presented. It is based on quantum computing principles, such as qubits, superposition, and entanglement of states. The HQGA was simulated in the Qiskit simulator. Qiskit simulator is a platform developed by IBM that allows working with quantum computers at the level of circuits, pulses, and algorithms. The performance of HQGA is evaluated in three strongly correlated KP data sets, and computational results are compared with a Quantum-Inspired Evolutionary Algorithm (QIEA), a modified version of a QIEA (QIEA-Q), and a modified version of the HQGA (HQGA-Q). Experimental results demonstrate that the proposed HQGA can obtain the best solutions in all the KP data sets, and performs well on robustness.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Quantum computing]]></kwd>
<kwd lng="en"><![CDATA[quantum genetic algorithm]]></kwd>
<kwd lng="en"><![CDATA[knapsack problem]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Adeyemo]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Ahmed]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Solving 0/1 knap-sack problem using metaheuristic techniques]]></source>
<year>2017</year>
<conf-name><![CDATA[ 9th IEEE-GCC Conference and Exhibition (GCCCE)]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1-6</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ajagekar]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[You]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Quantum computing for energy systems optimization: Challenges and opportunities]]></article-title>
<source><![CDATA[Energy]]></source>
<year>2019</year>
<volume>179</volume>
<page-range>76-89</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Arute]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Arya]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Babbush]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Quantum supremacy using a programmable superconducting processor]]></article-title>
<source><![CDATA[Nature]]></source>
<year>2019</year>
<volume>574</volume>
<page-range>505-10</page-range></nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ballance]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Harty]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Linke]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Sepiol]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Lucas]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[High-fidelity quantum logic gates using trapped-ion hyperfine qubits]]></article-title>
<source><![CDATA[Physical Review Letters]]></source>
<year>2016</year>
<volume>117</volume>
<numero>6</numero>
<issue>6</issue>
</nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Barends]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Kelly]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Megrant]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Veitia]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Sank]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Jeffrey]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[White]]></surname>
<given-names><![CDATA[T. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Mutus]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Fowler]]></surname>
<given-names><![CDATA[A. G.]]></given-names>
</name>
<name>
<surname><![CDATA[Campbell]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Superconducting quantum circuits at the surface code threshold for fault tolerance]]></article-title>
<source><![CDATA[Nature]]></source>
<year>2014</year>
<volume>508</volume>
<numero>7497</numero>
<issue>7497</issue>
<page-range>500-3</page-range></nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bhattacharjee]]></surname>
<given-names><![CDATA[K. K.]]></given-names>
</name>
<name>
<surname><![CDATA[Sarmah]]></surname>
<given-names><![CDATA[S. P.]]></given-names>
</name>
</person-group>
<source><![CDATA[A binary cuckoo search algorithm for knapsack problems]]></source>
<year>2015</year>
<conf-name><![CDATA[ International Conference on Industrial Engineering and Operations Management (IEOM)]]></conf-name>
<conf-date>2015</conf-date>
<conf-loc> </conf-loc>
<page-range>1-5</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bhattacharjee]]></surname>
<given-names><![CDATA[K. K.]]></given-names>
</name>
<name>
<surname><![CDATA[Sarmah]]></surname>
<given-names><![CDATA[S. P.]]></given-names>
</name>
</person-group>
<source><![CDATA[A binary firefly algorithm for knapsack problems]]></source>
<year>2015</year>
<conf-name><![CDATA[ IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)]]></conf-name>
<conf-date>2015</conf-date>
<conf-loc> </conf-loc>
<page-range>73-7</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Braine]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Egger]]></surname>
<given-names><![CDATA[D. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Glick]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Woerner]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Quantum algorithms for mixed binary optimization applied to transaction settlement]]></article-title>
<source><![CDATA[IEEE Transactions on Quantum Engineering]]></source>
<year>2021</year>
<volume>2</volume>
<page-range>1-8</page-range></nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cao]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Uhlmann]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<source><![CDATA[Analysis of deutschjozsa quantum algorithm]]></source>
<year>2018</year>
<volume>2018</volume>
<page-range>249</page-range><publisher-name><![CDATA[IACR Cryptology ePrint Archive]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cook]]></surname>
<given-names><![CDATA[S. A.]]></given-names>
</name>
</person-group>
<source><![CDATA[The complexity of theorem-proving procedures]]></source>
<year>1971</year>
<conf-name><![CDATA[ IN STOC]]></conf-name>
<conf-loc> </conf-loc>
<page-range>151-8</page-range></nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Du]]></surname>
<given-names><![CDATA[K.-L.]]></given-names>
</name>
<name>
<surname><![CDATA[Swamy]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Search and Optimization by Metaheuristics]]></source>
<year>2016</year>
</nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Forno]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Acquaviva]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Kobayashi]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Macii]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Urgese]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<source><![CDATA[A parallel hardware architecture for quantum annealing algorithm acceleration]]></source>
<year>2018</year>
<conf-name><![CDATA[ IFIP/IEEE International Conference on Very Large Scale Integration (VLSI-SoC)]]></conf-name>
<conf-date>2018</conf-date>
<conf-loc> </conf-loc>
<page-range>31-6</page-range></nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gao]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhao]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Quantum-inspired wolf pack algorithm to solve the 0-1 knapsack problem]]></article-title>
<source><![CDATA[Mathematical Problems in Engineering]]></source>
<year>2018</year>
<volume>2018</volume>
<page-range>1-10</page-range></nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[García]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Crawford]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Soto]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Castro]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Paredes]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A k-means binarization framework applied to multidimensional knapsack problem]]></article-title>
<source><![CDATA[Applied Intelligence]]></source>
<year>2018</year>
<volume>48</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>357-80</page-range></nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Han]]></surname>
<given-names><![CDATA[K.-H.]]></given-names>
</name>
<name>
<surname><![CDATA[Kim]]></surname>
<given-names><![CDATA[J.-H.]]></given-names>
</name>
</person-group>
<source><![CDATA[Genetic quantum algorithm and its application to combinatorial optimization problem]]></source>
<year>2000</year>
<volume>2</volume>
<numero>00TH8512</numero>
<conf-name><![CDATA[ Congress on Evolutionary Computation. CEC00]]></conf-name>
<conf-date>2000</conf-date>
<conf-loc> </conf-loc>
<issue>00TH8512</issue>
<page-range>1354-60</page-range></nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Han]]></surname>
<given-names><![CDATA[K.-H.]]></given-names>
</name>
<name>
<surname><![CDATA[Kim]]></surname>
<given-names><![CDATA[J.-H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Quantum-inspired evolutionary algorithm for a class of combinatorial optimization]]></article-title>
<source><![CDATA[Evolutionary Computation, IEEE Transactions on]]></source>
<year>2003</year>
<volume>6</volume>
<page-range>580-93</page-range></nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Han]]></surname>
<given-names><![CDATA[K.-H.]]></given-names>
</name>
<name>
<surname><![CDATA[Park]]></surname>
<given-names><![CDATA[K.-H.]]></given-names>
</name>
<name>
<surname><![CDATA[Lee]]></surname>
<given-names><![CDATA[C.-H.]]></given-names>
</name>
<name>
<surname><![CDATA[Kim]]></surname>
<given-names><![CDATA[J.-H.]]></given-names>
</name>
</person-group>
<source><![CDATA[Parallel quantum-inspired genetic algorithm for combinatorial optimization problem]]></source>
<year>2001</year>
<volume>2</volume>
<numero>01TH8546</numero>
<conf-name><![CDATA[ Congress on Evolutionary Computation]]></conf-name>
<conf-date>2001</conf-date>
<conf-loc> </conf-loc>
<issue>01TH8546</issue>
<page-range>1422-9</page-range></nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Huang]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A binary multi-scale quantum harmonic oscillator algorithm for 0&#8211;1 knapsack problem with genetic operator]]></article-title>
<source><![CDATA[IEEE Access]]></source>
<year>2019</year>
<volume>7</volume>
<page-range>137251-65</page-range></nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="">
<collab>IBM</collab>
<source><![CDATA[The qiskit elements]]></source>
<year>2020</year>
</nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jindal]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Bansal]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Effective methods for constraint handling in quantum inspired evolutionary algorithm for multi-dimensional 0&#8211;1 knapsack problem]]></source>
<year>2019</year>
<conf-name><![CDATA[ 4th International Conference on Information Systems and Computer Networks (ISCON)]]></conf-name>
<conf-date>2019</conf-date>
<conf-loc> </conf-loc>
<page-range>534-7</page-range></nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Johansson]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Larsson]]></surname>
<given-names><![CDATA[J.-A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Efficient classical simulation of the Deutsch&#8211;Jozsa and Simon&#8217;s algorithms]]></article-title>
<source><![CDATA[Quantum Information Processing]]></source>
<year>2017</year>
<volume>16</volume>
<numero>9</numero>
<issue>9</issue>
</nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Khemakhem]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Chebil]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A tree search based combination heuristic for the knapsack problem with setup]]></article-title>
<source><![CDATA[Computers &amp; Industrial Engineering]]></source>
<year>2016</year>
<volume>99</volume>
<page-range>280-6</page-range></nlm-citation>
</ref>
<ref id="B23">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[King]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Yarkoni]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Raymond]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Ozfidan]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[King]]></surname>
<given-names><![CDATA[A. D.]]></given-names>
</name>
<name>
<surname><![CDATA[Nevisi]]></surname>
<given-names><![CDATA[M. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Hilton]]></surname>
<given-names><![CDATA[J. P.]]></given-names>
</name>
<name>
<surname><![CDATA[McGeoch]]></surname>
<given-names><![CDATA[C. C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Quantum annealing amid local ruggedness and global frustration]]></source>
<year>2017</year>
</nlm-citation>
</ref>
<ref id="B24">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lai]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Hao]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Yue]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Gao]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<source><![CDATA[A diversification-based quantum particle swarm optimization algorithm for the multidimensional knapsack problem]]></source>
<year>2018</year>
<conf-name><![CDATA[ 5th IEEE International Conference on Cloud Computing and Intelligence Systems (CCIS)]]></conf-name>
<conf-date>2018</conf-date>
<conf-loc> </conf-loc>
<page-range>315-9</page-range></nlm-citation>
</ref>
<ref id="B25">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lai]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Hao]]></surname>
<given-names><![CDATA[J.-K.]]></given-names>
</name>
<name>
<surname><![CDATA[Fu]]></surname>
<given-names><![CDATA[Z.-H.]]></given-names>
</name>
<name>
<surname><![CDATA[Yue]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Diversity-preserving quantum particle swarm optimization for the multidimensional knapsack problem]]></article-title>
<source><![CDATA[Expert Systems with Applications]]></source>
<year>2020</year>
<volume>149</volume>
<page-range>113310</page-range></nlm-citation>
</ref>
<ref id="B26">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lai]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Hao]]></surname>
<given-names><![CDATA[J.-K.]]></given-names>
</name>
<name>
<surname><![CDATA[Yue]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2019</year>
<volume>274</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>35-48</page-range></nlm-citation>
</ref>
<ref id="B27">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An angle-expressed quantum evolutionary algorithm for quadratic knapsack problem]]></article-title>
<source><![CDATA[IOP Conference Series: Materials Science and Engineering]]></source>
<year>2019</year>
<volume>631</volume>
<page-range>052054</page-range></nlm-citation>
</ref>
<ref id="B28">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[C.-L.]]></given-names>
</name>
<name>
<surname><![CDATA[Wan]]></surname>
<given-names><![CDATA[M.-H.]]></given-names>
</name>
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[J.-Y.]]></given-names>
</name>
</person-group>
<source><![CDATA[An improved quantum genetic algorithm and its application]]></source>
<year>2010</year>
<conf-name><![CDATA[ International Conference on Computer Application and System Modeling]]></conf-name>
<conf-date>2010</conf-date>
<conf-loc> </conf-loc>
<page-range>413-8</page-range></nlm-citation>
</ref>
<ref id="B29">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[López-Sandoval]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Cobos]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Adiabatic quantum computing applied to the solution of the binary knapsack problem]]></article-title>
<source><![CDATA[RISTI - Revista Iberica de Sistemas e Tecnologias de Informacao]]></source>
<year>2020</year>
<volume>38</volume>
<page-range>214-27</page-range></nlm-citation>
</ref>
<ref id="B30">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Montiel Ross]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
<name>
<surname><![CDATA[Rubio]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Olvera]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Rivera]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Quantum-inspired acromyrmex evolutionary algorithm]]></article-title>
<source><![CDATA[Scientific Reports]]></source>
<year>2019</year>
<volume>9</volume>
</nlm-citation>
</ref>
<ref id="B31">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Montiel Ross]]></surname>
<given-names><![CDATA[O. H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A review of quantum-inspired metaheuristics: Going from classical computers to real quantum computers]]></article-title>
<source><![CDATA[IEEE Access]]></source>
<year>2020</year>
<volume>8</volume>
<page-range>814-38</page-range></nlm-citation>
</ref>
<ref id="B32">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Narayanan]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Quantum computing for beginners]]></source>
<year>1999</year>
<volume>3</volume>
<numero>99TH8406</numero>
<conf-name><![CDATA[ Congress on Evolutionary Computation-CEC99]]></conf-name>
<conf-date>1999</conf-date>
<conf-loc> </conf-loc>
<issue>99TH8406</issue>
<page-range>2231-8</page-range></nlm-citation>
</ref>
<ref id="B33">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Narayanan]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Moore]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Quantum-inspired genetic algorithms]]></source>
<year>1996</year>
</nlm-citation>
</ref>
<ref id="B34">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Nezamabadi-pour]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A quantum-inspired gravitational search algorithm for binary encoded optimization problems]]></article-title>
<source><![CDATA[Engineering Applications of Artificial Intelligence]]></source>
<year>2015</year>
<volume>40</volume>
<page-range>62-75</page-range></nlm-citation>
</ref>
<ref id="B35">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ozsoydan]]></surname>
<given-names><![CDATA[F. B.]]></given-names>
</name>
<name>
<surname><![CDATA[Baykasoglu]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A swarm intelligence-based algorithm for the set-union knapsack problem]]></article-title>
<source><![CDATA[Future Generation Computer Systems]]></source>
<year>2019</year>
<volume>93</volume>
<page-range>560-9</page-range></nlm-citation>
</ref>
<ref id="B36">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Paredes López]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Meneses Viveros]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Morales-Luna]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Algoritmo cuántico de Deutsch y Jozsa en GAMA]]></article-title>
<source><![CDATA[Revista mexicana de física]]></source>
<year>2018</year>
<volume>64</volume>
<page-range>181-9</page-range></nlm-citation>
</ref>
<ref id="B37">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pednault]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Gunnels]]></surname>
<given-names><![CDATA[J. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Nannicini]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Horesh]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Wisnieff]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Leveraging secondary storage to simulate deep 54-qubit sycamore circuits]]></source>
<year>2019</year>
</nlm-citation>
</ref>
<ref id="B38">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pisinger]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Where are the hard knapsack problems?]]></article-title>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2005</year>
<volume>32</volume>
<numero>9</numero>
<issue>9</issue>
<page-range>2271-84</page-range></nlm-citation>
</ref>
<ref id="B39">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Preskill]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Quantum computing and the entanglement frontier]]></source>
<year>2012</year>
</nlm-citation>
</ref>
<ref id="B40">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Preskill]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Quantum computing in the NISQ era and beyond]]></article-title>
<source><![CDATA[Quantum]]></source>
<year>2018</year>
<volume>2</volume>
<page-range>79</page-range></nlm-citation>
</ref>
<ref id="B41">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sapra]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Sharma]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Agarwal]]></surname>
<given-names><![CDATA[A. P.]]></given-names>
</name>
</person-group>
<source><![CDATA[Comparative study of metaheuristic algorithms using knapsack problem]]></source>
<year>2017</year>
<conf-name><![CDATA[ 7th International Conference on Cloud Computing, Data Science Engineering -Confluence]]></conf-name>
<conf-loc> </conf-loc>
<page-range>134-7</page-range></nlm-citation>
</ref>
<ref id="B42">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Shi]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<source><![CDATA[Solution to 0/1 knapsack problem based on improved ant colony algorithm]]></source>
<year>2006</year>
<conf-name><![CDATA[ IEEE International Conference on Information Acquisition]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1062-6</page-range></nlm-citation>
</ref>
<ref id="B43">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Si]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Shi]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
</person-group>
<source><![CDATA[A novel self-organizing quantum evolutionary algorithm for multi-objective optimization]]></source>
<year>2010</year>
<conf-name><![CDATA[ International Conference on Educational and Network Technology]]></conf-name>
<conf-date>2010</conf-date>
<conf-loc> </conf-loc>
<page-range>499-503</page-range></nlm-citation>
</ref>
<ref id="B44">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Srinivasan]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Satyajit]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Behera]]></surname>
<given-names><![CDATA[B. K.]]></given-names>
</name>
<name>
<surname><![CDATA[Panigrahi]]></surname>
<given-names><![CDATA[P. K.]]></given-names>
</name>
</person-group>
<source><![CDATA[Efficient quantum algorithm for solving travelling salesman problem: An IBM quantum experience]]></source>
<year>2018</year>
</nlm-citation>
</ref>
<ref id="B45">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tkachuk]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An adaptive quantum evolution algorithm for 0&#8211;1 knapsack problem]]></article-title>
<source><![CDATA[System research and information technologies]]></source>
<year>2018</year>
<page-range>77-88</page-range></nlm-citation>
</ref>
<ref id="B46">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tkachuk]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
<name>
<surname><![CDATA[Tkachuk]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Higher-order quantum genetic algorithm for 0-1 knapsack problem]]></article-title>
<source><![CDATA[System research and information technologies]]></source>
<year>2018</year>
<page-range>52-67</page-range></nlm-citation>
</ref>
<ref id="B47">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Williams]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Explorations in Quantum Computing]]></source>
<year>2011</year>
</nlm-citation>
</ref>
<ref id="B48">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Jiang]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Nguyen]]></surname>
<given-names><![CDATA[T. T.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Metaheuristics for dynamic combinatorial optimization problems]]></article-title>
<source><![CDATA[IMA Journal of Management Mathematics]]></source>
<year>2012</year>
<volume>24</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>451-80</page-range></nlm-citation>
</ref>
<ref id="B49">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Yanofsky]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Manucci]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Quantum computing for computer scientists]]></source>
<year>2008</year>
</nlm-citation>
</ref>
<ref id="B50">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Quantum-inspired evolutionary algorithms: A survey and empirical study]]></article-title>
<source><![CDATA[J. Heuristics]]></source>
<year>2011</year>
<volume>17</volume>
<page-range>303-51</page-range></nlm-citation>
</ref>
<ref id="B51">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Gao]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<source><![CDATA[Improved quantum evolutionary algorithm for combinatorial optimization problem]]></source>
<year>2007</year>
<volume>6</volume>
<conf-name><![CDATA[ International Conference on Machine Learning and Cybernetics]]></conf-name>
<conf-date>2007</conf-date>
<conf-loc> </conf-loc>
<page-range>3501-5</page-range></nlm-citation>
</ref>
<ref id="B52">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zhou]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhou]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An improved monkey algorithm for a 0-1 knapsack problem]]></article-title>
<source><![CDATA[Applied Soft Computing]]></source>
<year>2016</year>
<volume>38</volume>
<page-range>817-30</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
