This paper presents anew algorithm for solving the Travelling Salesmm Problem (TSP). The TSP is one of the most known combinatorial optimisation problems. It is about finding the shortest Homilronian cycle relating N cities. The algorithm is inspired from both genetic aigorithms and quantum compirting fields. It exrends the standard genedic dgorifhms by combining them to some concepts and principles provided from quantum computing field szich as giiantum bit, states superposition and intetfterence. The obfained resulls fram fhe application of the proposed algorithm on some insfumes of TSP are signi5canfly bettw than those provided by standard genetic algorithms.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.