Travelling Salesman Problem using Prim Algorithm in High Performance Computing

• Main Author: Wan Harun, Wan Nurhafizah
• Format: Final Year Project
• Language: English
• Published: Universiti teknologi petronas 2007
• Subjects: ZA Information resources
• Online Access: http://utpedia.utp.edu.my/9561/1/2007%20Bachelor%20-%20Travelling%20Salesman%20Problem%20Using%20Prims%20Algorithm%20In%20High%20Performance%20Computing.pdf; http://utpedia.utp.edu.my/9561/

Thanks to the advances in wide area network technology and the low cost of computing resources, High Performance Computing came into being and currently research area. One incentive of High Performance Computing is to summative the power of widely distributed resources, and provide non-trivial services to users. To achieve this goal an efficient job scheduling algorithm system is an essential part of the High Performance Computing. This preliminary report emphasizes on the basic terms of the efficient job scheduling algorithm for traveling salesman problem in high performance computing. Job scheduling algorithm will reduce the traffic between the processors and can help improve resource utilization and quality of service. Traveling salesman problem is finding is the shortest path connecting number of locations such as cities, visited by a traveling salesman on his sales route. TSP has been used in The Two-Period Travelling Salesman Problem Applied to Milk Collection in Ireland and Usefulness of Solution Algorithms of the Travelling Salesman Problem in the typing of Biological Sequences in a Clinical Laboratory Setting.