Abstract

Mobile Ad Hoc Networks are self configuring networks that not rely in any centralised device. Such a network faces many challenges especially when a routing capability is desired. In this paper the situation in which a mobile pedestrian has to find the way to visit many places once is presented. An optimum mathematical model solution is compared against different solutions obtained via genetics algorithm. Genetic algorithms demonstrate that acquire a good result in a high-quality manner with a difference of 13.84% respect to the optimal solution. Also complexity studies are carry out.