QUANTUM INSPIRED EVOLUTIONARY ALGORITHM FOR SOLVING MULTIPLE TRAVELLING SALESMAN PROBLEM

Abstract

Quantum computing is a relatively new but very promising field of computer science.It provides an alternative way of building computers which are significantly better than current day's classical computers.Here in this paper, we attempt to develop an algorithm which makes use of the concepts of quantum computers but are actually run on classical computers.Hence this is rather a novel approach.The algorithm is actually an optimization algorithm for solving the much famous multiple travelling salesman problem (mtsp).The algorithm further merges the methodologies followed by evolutionary algorithms.So, at first we model an overall algorithm based on these concepts.Our algorithm is termed as quantum inspired evolutionary algorithm.With this basic approach we use multi chromosome technique and update solution using particle swarm optimization technique.Later on we compare these results with standard optimal solution for the problem and present a comparison for the same.