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

Abstract

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.