Parallelization of the Traveling Salesman Problem by Clustering its Nodes and Finding the Best Route Passing through the Centroids.
Vadim V. RomanukePublished in: Appl. Comput. Syst. (2023)
Keyphrases
- traveling salesman problem
- k means
- clustering algorithm
- combinatorial optimization
- shortest path
- ant colony optimization
- combinatorial problems
- optimization problems
- vehicle routing problem
- ant colony optimization algorithm
- data points
- clustering method
- combinatorial optimization problems
- hamiltonian cycle
- traveling salesman
- discrete particle swarm optimization
- genetic local search
- travel time
- network structure
- graph structure
- crossover operator
- data objects
- transportation networks
- neural network
- branch and bound
- edge weights
- connected components
- distance metric
- metaheuristic