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...
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2009
|
| Subjects: | |
| Online Access: | http://scholars.utp.edu.my/id/eprint/167/ http://scholars.utp.edu.my/id/eprint/167/1/paper.pdf |
| _version_ | 1848658927695167488 |
|---|---|
| author | I.A., Aziz Haron, N. Mehat, M. Jung, L.T. Mustapa, A.N. Akir, E.A.P. |
| author_facet | I.A., Aziz Haron, N. Mehat, M. Jung, L.T. Mustapa, A.N. Akir, E.A.P. |
| author_sort | I.A., Aziz |
| building | UTP Institutional Repository |
| collection | Online Access |
| description | 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 scratch and written in C language. The sequential algorithm is then converted into a parallel algorithm by integrating it with the Message Passing Interface (MPI) libraries so that it can be executed on a cluster computer. Our main aim by creating the parallel algorithm is to accelerate the execution time of solving TSP. Experimental results conducted on Beowulf cluster are presented to demonstrate the viability of our work as well as the efficiency of the parallel algorithm.
|
| first_indexed | 2025-11-13T07:22:19Z |
| format | Article |
| id | oai:scholars.utp.edu.my:167 |
| institution | Universiti Teknologi Petronas |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-13T07:22:19Z |
| publishDate | 2009 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | oai:scholars.utp.edu.my:1672017-01-19T08:25:43Z http://scholars.utp.edu.my/id/eprint/167/ Solving traveling salesman problem on cluster compute nodes I.A., Aziz Haron, N. Mehat, M. Jung, L.T. Mustapa, A.N. Akir, E.A.P. QA75 Electronic computers. Computer science 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 scratch and written in C language. The sequential algorithm is then converted into a parallel algorithm by integrating it with the Message Passing Interface (MPI) libraries so that it can be executed on a cluster computer. Our main aim by creating the parallel algorithm is to accelerate the execution time of solving TSP. Experimental results conducted on Beowulf cluster are presented to demonstrate the viability of our work as well as the efficiency of the parallel algorithm. 2009 Article NonPeerReviewed application/pdf en http://scholars.utp.edu.my/id/eprint/167/1/paper.pdf I.A., Aziz and Haron, N. and Mehat, M. and Jung, L.T. and Mustapa, A.N. and Akir, E.A.P. (2009) Solving traveling salesman problem on cluster compute nodes. WSEAS Transactions on Computers, 8 (6). pp. 1020-1029. ISSN 11092750 |
| spellingShingle | QA75 Electronic computers. Computer science I.A., Aziz Haron, N. Mehat, M. Jung, L.T. Mustapa, A.N. Akir, E.A.P. Solving traveling salesman problem on cluster compute nodes |
| title | Solving traveling salesman problem on cluster compute nodes
|
| title_full | Solving traveling salesman problem on cluster compute nodes
|
| title_fullStr | Solving traveling salesman problem on cluster compute nodes
|
| title_full_unstemmed | Solving traveling salesman problem on cluster compute nodes
|
| title_short | Solving traveling salesman problem on cluster compute nodes
|
| title_sort | solving traveling salesman problem on cluster compute nodes |
| topic | QA75 Electronic computers. Computer science |
| url | http://scholars.utp.edu.my/id/eprint/167/ http://scholars.utp.edu.my/id/eprint/167/1/paper.pdf |