Parallelization of the Traveling Salesman Problem by Clustering its Nodes and Finding the Best Route Passing through the Centroids
A method of heuristically solving large and extremely large traveling salesman problems is suggested. The solver is a specific genetic algorithm producing approximately shortest routes the fastest of known heuristics without losing much in accuracy. The method consists in parallelizing the problem b...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2023-12-01
|
| Series: | Applied Computer Systems |
| Subjects: | |
| Online Access: | https://doi.org/10.2478/acss-2023-0019 |