Traveling Salesman Problem in Distributed Environment

摘要

In this paper, we focus on developing parallel algorithms for solving the traveling salesmanproblem (TSP) based on Nicos Christofides algorithm released in 1976. The parallel algorithmis built in the distributed environment with multi-processors (Master-Slave). The algorithm isinstalled on the computer cluster system of National University of Education in Hanoi,Vietnam (ccs1.hnue.edu.vn) and uses the library PJ (Parallel Java). The results are evaluatedand compared with other works.