Solving Very Large Traveling Salesman Problems by SOM Parallelization on Cluster Architectures

This paper describes how to solve very large Traveling- Salesman Problems heuristically by the parallelization of self-organizing maps on cluster architectures. The used way of parallelizing is a sophisticated Structural Data Parallel approach based on the SPMD model. We distinguish between a non-sophisticated and a sophisticated approach for efficient and simple parallelization of the SOMs.