In this thesis, three different algorithms with different perspectives (Close Couple, Worm, and Spider Web) has been developed to solve the Symmetric Traveling Salesman (TSP) heuristically. Improved algorithms with different ...