Proposed Quantum AI solution for the Travelling Tournament Problem
Clifford Fernandes, Desmond Lobo, Sarang Gawane, Kalpita Ajinkya Wagaskar · 2020 International Conference for Emerging Technology (INCET) · 2020
In this paper, we propose an idea/solution for the Travelling Tournament Problem, which is a unique combinatorial problem tackling both feasibility and optimality of the solution. Being an NP-Hard problem, generating solutions can be extremely cost-ly, with most of the solutions of the said problem having a time complexity of as high as O(n!). Quantum Computing and artificial intelligence, on the other hand, is making great strides, and we believe that the immense computational potential of quantum computing can be used to solve these scheduling problems. Artificial Intelligence and machine learning present us with excellent frame-work strategies that we have envisaged to incorporate in our implementation. In the following paper, we delineate the features of our solution and how we propose to incorporate the quantum and classical aspects of computing.