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.
-
Updated
Feb 6, 2024 - Java
#
pmx-crossover
Here are 4 public repositories matching this topic...
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.
genetic-algorithm mutation selection evolutionary-algorithms tsp evolutionary-algorithm evolutionary-computation crossover tsp-problem travelling-salesman-problem tsp-solver pmx-crossover edge-crossover tournoment-selection
-
Updated
Jan 5, 2024 - Python
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.
-
Updated
Dec 17, 2023 - Python
Implementation of the genetic algorithm with the PMX crossover for the traveling salesman optimization problem
-
Updated
Dec 2, 2024 - HTML
Improve this page
Add a description, image, and links to the pmx-crossover topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the pmx-crossover topic, visit your repo's landing page and select "manage topics."