<p><span>Travelling salesman problem is a well researched in computer science and has many practical applications. It classified as NP-hard its exact solution can only be obtained exponential time unless P = NP. There are different variants of the travelling (TSP) this paper, asymmetric addressed since variant quite often observed real world scenarios. number heuristic approaches to...