>
Fa   |   Ar   |   En
   Optimization and Comparison of Travelling Salesman Problem Using Ant Colony and Genetic Algorithms  
   
نویسنده DİKMEN Hasan ,DİKMEN Hüseyin ,ELBİR Ahmet ,EKŞİ Ziya ,ÇELİK Fatih
منبع journal of natural and applied sciences - 2014 - دوره : 18 - شماره : 1 - صفحه:8 -13
چکیده    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.
کلیدواژه Travelling Salesman Problem ,Ant Colony Algorithm ,Genetic Algorithm ,Route Planning
آدرس Sakarya Üniversitesi, Fen Bilimleri Enstitüsü, Bilgisayar Mühendisliği ABD, Turkey, Sakarya Üniversitesi, Fen Bilimleri Enstitüsü, Bilgisayar Mühendisliği ABD, Turkey, Yıldız Teknik Üniversitesi, Elektrik-Elektronik Fakültesi, Bilgisayar Mühendisliği Bölümü, Turkey, Sakarya Üniversitesi, Teknik Eğitim Fakültesi, Elektronik ve Bilgisayar Eğitimi Bölümü, Turkey, Sakarya Üniversitesi, Teknoloji Fakültesi, Bilgisayar Mühendisliği Bölümü, Turkey
 
     
   
Authors
  
 
 

Copyright 2023
Islamic World Science Citation Center
All Rights Reserved