DSpace Repository

Browsing by Subject "Traveling Salesman Problem"

Browsing by Subject "Traveling Salesman Problem"

Sort by: Order: Results:

  • Kaya, Ahmet Sedat (2015-01)
    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 ...