The Comparison of A* Algorithm and Ant Colonial Optimization for Mobile Traveler Application

AYDIN A., Telceken S.

23nd Signal Processing and Communications Applications Conference (SIU), Malatya, Türkiye, 16 - 19 Mayıs 2015, ss.491-494 identifier identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Doi Numarası: 10.1109/siu.2015.7129866
  • Basıldığı Şehir: Malatya
  • Basıldığı Ülke: Türkiye
  • Sayfa Sayıları: ss.491-494
  • Anahtar Kelimeler: Route planning, Mobile application, A* algorithm, Ant Colonial Optimization
  • Anadolu Üniversitesi Adresli: Evet

Özet

In this paper, a route planning application has been developed for mobile devices. The goal was to select the algorithm that computes the route in the shortest amount of time. To this end, a database containing information and high-resolution pictures of the touristic locations in Eskisehir province have been created. For each interest point in the database, optimal routes have been computed using such complete search algorithms as A* and Ant Colonial Optimization found in the literature. The experimental work has shown that A* algorithm runs up to 80% faster than the Ant Colonial Optimization as the number of interest points increases.