Matematik ve Bilgisayar Bölümü Tezleri

Permanent URI for this collectionhttps://hdl.handle.net/20.500.12416/222

Browse

Browsing Matematik ve Bilgisayar Bölümü Tezleri by Subject "Algorithm"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • Item
    Citation Count: KAYA, A.S. (2015). Traveling salesman problem: herustics and empirical evaluation. Yayımlanmamış yüksek lisans tezi. Ankara: Çankaya Üniversitesi Fen Bilimleri Enstitüsü
    Traveling salesman problem: herustics and empirical evaluation
    (2015-01) Kaya, Ahmet Sedat; Çankaya Üniversitesi, Fen Bilimleri Enstitüsü, Matematik ve Bilgisayar Bölümü
    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 data sets Distance Rate, Target have been tested. The running time and value of the solution have been compared. In this context, several steps of evaluation were used for the comparison and improvement of algorithms. After each evaluation step, one candidate algorithm is eliminated. Eventually, an improved version of the Spider Web algorithm is the winner of this contest.