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...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Published: |
2009
|
| Subjects: | |
| Online Access: | http://eprints.utp.edu.my/167/1/paper.pdf http://eprints.utp.edu.my/167/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|