Modeling of tool path movement as TSP at parallel virtual machine
Faculty / School
Faculty of Computer Sciences (FCS)
Department of Computer Science
Was this content written or created while at IBA?
The IASTED International Conference on Applied Simulation and Modelling (ASM 2005)
15-17 June 2005
Abstract / Description
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.
Khan, W. A. (2005). Modeling of tool path movement as TSP at parallel virtual machine., 161. Retrieved from https://ir.iba.edu.pk/faculty-research-series/65