Comparison of Heuristic Algorithms to Solving Mesh Network Path Finding Problem

In this paper, we concentrate on efficiency of path finding problem with obstacles. The implemented algorithms for solving such a problem are based on ant colony optimization, genetic algorithm idea, simulated annealing and simple algorithms. The simple algorithms like random search and Nai¿ve algorithm are considered either. As the investigation tool we have designed and implemented computer experimentation system in Java technology. In the paper, the results of some research are reported and discussed. During investigations we focus on such parameters like shape of the mesh and amount of obstacles. The comparison of algorithms properties is made using the introduced indices of performance treated as a measure to effectiveness of examined algorithms.