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...

Full description

Bibliographic Details

Published in:	Applied Computer Systems
Main Author:	Romanuke Vadim
Format:	Article
Language:	English
Published:	Sciendo 2023-12-01
Subjects:	approximately shortest route centroids clustered subproblems genetic algorithm parallelization route length traveling salesman problem
Online Access:	https://doi.org/10.2478/acss-2023-0019