The travelling salesman problem (TSP) is a nondeterministic Polynomial hard problem in combinatorial optimization studied in operations research and theoretical computer science. And to solve this problem we used two popular ...