Solving the Travelling Salesman Problem in Parallel by Genetic Algorithm on Multicomputer Cluster

The paper investigates the efficiency of the parallel computation of the travelling salesman problem using the genetic approach on a slack multicomputer cluster. For the parallel algorithm design functional decomposition of the parallel application has been made and the manager/workers paradigm is applied. Performance estimation and parallelism profiling have been made on the basis of MPI-based parallel program implementation.