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

Authors:

1 January 2005

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

p. 954-958
DOI:10.1109/pdcat.2005.223

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

TRAVELING SALESMAN PROBLEMS
NEURAL NETWORKS
CITIES AND TOWNS
COMPUTER ARCHITECTURE
EMPLOYMENT
COSTS
NEURAL NETWORK HARDWARE
CENTRALIZED CONTROL
SELF ORGANIZING FEATURE MAPS
STATISTICS

This publication has 3 references indexed in Scilit:

Self-Organizing Maps
2001
Simulating artificial neural networks on parallel architectures
Computer, 1996
TSPLIB—A Traveling Salesman Problem Library
INFORMS Journal on Computing, 1991