There are 0 repository under pmx-crossover topic.
This Java-based project aims to solve the Traveling Salesman Problem (TSP) using a parallelized approach with multithreading and the Partially Mapped Crossover (PMX) technique.
I developed this project to delve into Genetic Algorithms and their application to optimization problems. Feel free to explore the code, run the algorithm, and share your feedback.
This code implements a genetic algorithm for solving the Traveling Salesman Problem (TSP) on a set of cities from a distance matrix, utilizing techniques such as tournament selection, PMX crossover, inversion and exchange mutations, and elitism to optimize the route and minimize total distance.