Quantum-Inspired Estimation Of Distribution Algorithm To Solve The Travelling Salesman Problem

A novel Quantum-Inspired Estimation of Distribution Algorithm (QIEDA) is proposed to solve the Travelling Salesman Problem (TSP). The QIEDA uses a modified version of the W state quantum circuits to sample new solutions during the algorithm runtime. The algorithm behaviour is compared with other state-of-the-art population-based algorithms. QIEDA convergence is faster than other algorithms, and the obtained solutions improve as the size of the problem increases. Moreover, we show that quantum noise enhances the search of an optimal solution. Because quantum computers differ from each other, partly due to the topology that distributes the qubits, the computational cost of executing the QIEDA in different topologies is analyzed and an ideal topology is proposed for the TSP solved with the QIEDA.

[1]  Michael Defoin-Platel,et al.  A versatile quantum-inspired evolutionary algorithm , 2007, 2007 IEEE Congress on Evolutionary Computation.

[2]  Miodrag Lovric,et al.  Student's t-Tests , 2011, International Encyclopedia of Statistical Science.

[3]  H. Mühlenbein,et al.  From Recombination of Genes to the Estimation of Distributions I. Binary Parameters , 1996, PPSN.

[4]  Michael Defoin-Platel,et al.  Quantum-Inspired Evolutionary Algorithm: A Multimodel EDA , 2009, IEEE Transactions on Evolutionary Computation.

[5]  Maria Schuld,et al.  Supervised Learning with Quantum Computers , 2018 .

[6]  Max Henrion,et al.  Propagating uncertainty in bayesian networks by probabilistic logic sampling , 1986, UAI.

[7]  Justin Dauwels,et al.  Deep Reinforcement Learning for Traveling Salesman Problem with Time Windows and Rejections , 2020, 2020 International Joint Conference on Neural Networks (IJCNN).

[8]  Nicolas Macris,et al.  Efficient Quantum Algorithms for GHZ and W States, and Implementation on the IBM Quantum Computer , 2018, Advanced Quantum Technologies.

[9]  Oscar H. Montiel Ross A Review of Quantum-Inspired Metaheuristics: Going From Classical Computers to Real Quantum Computers , 2020, IEEE Access.

[10]  J. A. Lozano,et al.  Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .

[11]  John Holland,et al.  Adaptation in Natural and Artificial Sys-tems: An Introductory Analysis with Applications to Biology , 1975 .

[12]  C. Weedbrook,et al.  Quantum Machine Learning over Infinite Dimensions. , 2016, Physical review letters.

[13]  Pedro Larrañaga,et al.  Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators , 1999, Artificial Intelligence Review.

[14]  Hui Yu Optimized Ant Colony Algorithm by Local Pheromone Update , 2014 .

[15]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[16]  Gexiang Zhang,et al.  Quantum-inspired evolutionary algorithms: a survey and empirical study , 2011, J. Heuristics.

[17]  Paul A. Viola,et al.  MIMIC: Finding Optima by Estimating Probability Densities , 1996, NIPS.

[18]  Jo Campling,et al.  Analysis of Variance (ANOVA) , 2002 .

[19]  Daisuke Yamamoto,et al.  Applying Deep Learning and Reinforcement Learning to Traveling Salesman Problem , 2018, 2018 International Conference on Computing, Electronics & Communications Engineering (iCCECE).

[20]  Seth Lloyd,et al.  Quantum algorithm for data fitting. , 2012, Physical review letters.

[21]  Oscar Montiel,et al.  Quantum-Inspired Acromyrmex Evolutionary Algorithm , 2019, Scientific Reports.

[22]  Yuhui Shi,et al.  Metaheuristic research: a comprehensive survey , 2018, Artificial Intelligence Review.

[23]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[24]  Jong-Hwan Kim,et al.  Quantum-inspired evolutionary algorithm for a class of combinatorial optimization , 2002, IEEE Trans. Evol. Comput..

[25]  Tien D. Kieu,et al.  The travelling salesman problem and adiabatic quantum computation: an algorithm , 2018, Quantum Inf. Process..

[26]  Sarman K. Hadia,et al.  Solving City Routing Issue with Particle Swarm Optimization , 2012 .

[27]  Ricardo Tanscheit,et al.  Quantum-inspired genetic algorithms applied to ordering combinatorial optimization problems , 2012, 2012 IEEE Congress on Evolutionary Computation.

[28]  Laszlo Gyongyosi,et al.  Quantum State Optimization and Computational Pathway Evaluation for Gate-Model Quantum Computers , 2020, Scientific Reports.

[29]  Concha Bielza,et al.  A review on probabilistic graphical models in evolutionary computation , 2012, J. Heuristics.

[30]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[31]  David E. Goldberg,et al.  Genetic algorithms and Machine Learning , 1988, Machine Learning.

[32]  Pedro Larrañaga,et al.  Solving the Traveling Salesman Problem with EDAs , 2002, Estimation of Distribution Algorithms.

[33]  Ricardo Tanscheit,et al.  Quantum inspired evolutionary algorithm for ordering problems , 2017, Expert Syst. Appl..

[34]  Giuliano Benenti,et al.  Principles of Quantum Computation and Information:Volume II: Basic Tools and Special Topics , 2007 .

[35]  Yue Ruan,et al.  The Quantum Approximate Algorithm for Solving Traveling Salesman Problem , 2020, Computers, Materials & Continua.

[36]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[37]  Nir Friedman,et al.  Probabilistic Graphical Models - Principles and Techniques , 2009 .