Solving the Traveling Sales Person problem using genetic algorithms.

• This project aim is to solve the traveling salesperson problem using genetic algorithms, with different combinations of selection algorithms, crossover, and mutation operators. A comparative study analysis is used to identify the parameters that achieve the best results for the problem in question.