W.A. Khan (Pakistan)
TSP, Production Machinery, Distributed Computing
: Traveling Salesman Problems (TSP) is a classical mathematical problem. From combinatorial optimization perspective it is also NP-Hard. Several algorithms exist: such as Simulated Annealing Algorithm, Tabu Search, Neural Networks and Genetic Algorithm to establish a near optimal solution. In this research paper it is shown that the ordinary personal computers networked as Parallel Virtual Machine (PVM) and supplemented with the software based implicit and explicit portioning of the domain can give Eulerian routes for TSPs. In other cases of very large scale TSP a non-Eulerian path with significant reduction in distance is achieved that has practical applications in many cases including production machinery.
Important Links:
Go Back
