Have a personal or library account? Click to login
Parallelization of the Traveling Salesman Problem by Clustering its Nodes and Finding the Best Route Passing through the Centroids Cover

Parallelization of the Traveling Salesman Problem by Clustering its Nodes and Finding the Best Route Passing through the Centroids

Applied Computer Systems
Volume 28 (2023): Issue 2 (December 2023)
By: Vadim Romanuke  
Open Access
|Jan 2024

Download Article

Download the full article as a PDF file.

DOI: https://doi.org/10.2478/acss-2023-0019 | Journal eISSN: 2255-8691 | Journal ISSN: 2255-8683
Journal RSS Feed
Language: English
Page range: 189 - 202
Published on: Jan 29, 2024
Published by: Riga Technical University
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year
Keywords:
Approximately shortest route,
centroids,
clustered subproblems,
genetic algorithm,
parallelization,
route length,
traveling salesman problem
Related subjects:
Computer sciences,
Artificial intelligence,
Information technology,
Project management,
Software development

© 2024 Vadim Romanuke, published by Riga Technical University
This work is licensed under the Creative Commons Attribution 4.0 License.

Previous articleVolume 28 (2023): Issue 2 (December 2023)Next article