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

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Hannes Schabauer Articles by Erich Schikuta Articles by Thomas Weishaupl

Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)

Dalian, China

December 05-December 08

ISBN: 0-7695-2405-2

	ASCII Text	x
	Hannes Schabauer, Erich Schikuta, Thomas Weishaupl, "Solving Very Large Traveling Salesman Problems by SOM Parallelization on Cluster Architectures," Parallel and Distributed Computing Applications and Technologies, International Conference on, pp. 954-958, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05), 2005.

	BibTex	x
	@article{ 10.1109/PDCAT.2005.223, author = {Hannes Schabauer and Erich Schikuta and Thomas Weishaupl}, title = {Solving Very Large Traveling Salesman Problems by SOM Parallelization on Cluster Architectures}, journal ={Parallel and Distributed Computing Applications and Technologies, International Conference on}, volume = {0}, year = {2005}, isbn = {0-7695-2405-2}, pages = {954-958}, doi = {http://doi.ieeecomputersociety.org/10.1109/PDCAT.2005.223}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Parallel and Distributed Computing Applications and Technologies, International Conference on TI - Solving Very Large Traveling Salesman Problems by SOM Parallelization on Cluster Architectures SN - 0-7695-2405-2 SP954 EP958 A1 - Hannes Schabauer, A1 - Erich Schikuta, A1 - Thomas Weishaupl, PY - 2005 KW - null VL - 0 JA - Parallel and Distributed Computing Applications and Technologies, International Conference on ER -

Hannes Schabauer, University of Vienna, Austria

Erich Schikuta, University of Vienna, Austria

Thomas Weishaupl, University of Vienna, Austria

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PDCAT.2005.223

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.

Citation:

Hannes Schabauer, Erich Schikuta, Thomas Weishaupl, "Solving Very Large Traveling Salesman Problems by SOM Parallelization on Cluster Architectures," pdcat, pp.954-958, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05), 2005

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.