Parallelized neural network system for solving Euclidean traveling salesman problem
We introduce a parallel-friendly system based on a self-organizing map to solve largescale traveling salesman problems. We present a divide and conquer method to split large problems to a set of small problems and collect the results in an efficient way. We experiment new system over TSPLIB sample problems with different levels of parallelization.
parallelization euclidean traveling salesman problem self-organized map tsplib artificial neural network