Pedestrian routing system using genetic algorithms suitable for mobile ad hoc networks

  • Authors:
  • J. Bravo;I. Soto;R. Carrasco

  • Affiliations:
  • School of Electrical, Electronic and Computer Engineering, University of Newcastle upon Tyne, UK;Universidad de Santiago de Chile, Chile, Industrial Engineering Department, University of Santiago of Chile;School of Electrical, Electronic and Computer Engineering, University of Newcastle upon Tyne, UK

  • Venue:
  • MATH'06 Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.