Author/Authors :
DİKMEN, Hasan Sakarya Üniversitesi - Fen Bilimleri Enstitüsü - Bilgisayar Mühendisliği ABD, Turkey , DİKMEN, Hüseyin Sakarya Üniversitesi - Fen Bilimleri Enstitüsü - Bilgisayar Mühendisliği ABD, Turkey , ELBİR, Ahmet Yıldız Teknik Üniversitesi - Elektrik-Elektronik Fakültesi - Bilgisayar Mühendisliği Bölümü, Turkey , EKŞİ, Ziya Sakarya Üniversitesi - Teknik Eğitim Fakültesi - Elektronik ve Bilgisayar Eğitimi Bölümü, Turkey , ÇELİK, Fatih Sakarya Üniversitesi - Teknoloji Fakültesi - Bilgisayar Mühendisliği Bölümü, Turkey
Abstract :
Inthisstudy, performance of Ant Colony and Genetic Algorithms that is one of artificial intelligence techniques were compared in order to solve traveling salesman problem that is one of route-planning problem. The best route over the map of Turkey is aimed to find. Performance of the sealgorithms in terms of route distance and route prediction time were investigated. A C#-based interface was designed for implementation of the application and monitoring of the experimental results. As a result of the application, it is observed that Ant Colony algorithm has more high performance than genetic algorithm in terms of both route distance and performance time.
NaturalLanguageKeyword :
Travelling Salesman Problem , Ant Colony Algorithm , Genetic Algorithm , Route Planning
