Abstract: | This paper aims to describe the implementation of a genetic algorithm system in order to search the optimal routes between two cities. Above the deterministic methods, which, in most of cases, offer us the best path, the algorithm implemented here (a stochastic algorithm), can provide the best “k” paths. This option is recommended for us, if we want to choose a road from the best (short) existing. For a better exemplification we considered the map of Romania, a map with 23 cities, the route that we want to find being Arad – Suceava. |