The travelling salesman problem (TSP) is a NP-hard problem in combinatorial optimization. A solution to this problem can be successfully used in touring airports to find shortest routes through selections of airports ...