DocumentCode
3065857
Title
Solving Very Large Traveling Salesman Problems by SOM Parallelization on Cluster Architectures
Author
Schabauer, Hannes ; Schikuta, Erich ; Weishäupl, Thomas
Author_Institution
University of Vienna, Austria
fYear
2005
fDate
05-08 Dec. 2005
Firstpage
954
Lastpage
958
Abstract
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.
Keywords
Centralized control; Cities and towns; Computer architecture; Costs; Employment; Neural network hardware; Neural networks; Self organizing feature maps; Statistics; Traveling salesman problems;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Computing, Applications and Technologies, 2005. PDCAT 2005. Sixth International Conference on
Print_ISBN
0-7695-2405-2
Type
conf
DOI
10.1109/PDCAT.2005.223
Filename
1579072
Link To Document