No abstract

No abstract

No abstract

No abstract

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.

No abstract

No abstract

No abstract