Sciweavers

Share
PDCAT
2005
Springer

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

10 years 19 days ago
Solving Very Large Traveling Salesman Problems by SOM Parallelization on Cluster Architectures
This paper describes how to solve very large TravelingSalesman 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.
Hannes Schabauer, Erich Schikuta, Thomas Weish&aum
Added 28 Jun 2010
Updated 28 Jun 2010
Type Conference
Year 2005
Where PDCAT
Authors Hannes Schabauer, Erich Schikuta, Thomas Weishäupl
Comments (0)
books