Solving traveling salesman problem on cluster compute nodes

In this paper, we present a parallel implementation of a solution for the Traveling Salesman Problem (TSP). TSP is the problem of finding the shortest path from point A to point B, given a set of points and passing through each point exactly once. Initially a sequential algorithm is fabricated from...

Full description

Bibliographic Details

Main Authors:	I.A., Aziz, Haron, N., Mehat, M., Jung, L.T., Mustapa, A.N., Akir, E.A.P.
Format:	Article
Language:	en
Published:	2009
Subjects:	QA75 Electronic computers. Computer science
Online Access:	http://scholars.utp.edu.my/id/eprint/167/1/paper.pdf http://scholars.utp.edu.my/id/eprint/167/
Tags:	Add Tag No Tags, Be the first to tag this record!