Solving the N-Queen problem using a Genetic Algorithm in C and Python3 with PMX crossover .
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.
Implementation of the genetic algorithm with the PMX crossover for the traveling salesman optimization problem
Implementiraj rješenje TSP problema s 30 gradova generiranih na 2D ravnini. Cilj je pronaći najkraći put koji posjećuje svaki grad jednom i vraća se na početnu točku. Koristi se Genetski algoritam
To associate your repository with the pmx-crossover topic, visit your repo's landing page and select "manage topics."