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: | I.A., Aziz, Haron, N., Mehat, M., Jung, L.T., Mustapa, A.N., Akir, E.A.P. |
---|---|
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!
|
Similar Items
-
Solving the Traveling Salesman’s Problem using the African Buffalo Optimization
by: Odili, Julius Beneoluchi, et al.
Published: (2016) -
Tutorials on African Buffalo Optimization for Solving the Travelling Salesman Problem
by: Odili, Julius Beneoluchi, et al.
Published: (2017) -
Particle swarm optimization with partial search to solve traveling salesman problem
by: Akhand, M.A.H., et al.
Published: (2012) -
Particle swarm optimization with partial search for solving traveling salesman problem
by: Akhand, M. A. H, et al.
Published: (2014) -
Simulated annealing with probabilistic analysis for solving traveling salesman problems
by: Hong, Pei Yee, et al.
Published: (2013)