Parallel Branch and Bound Model Using Logarithmic Sampling (PBLS) for Symmetric Traveling Salesman Problem

Free registration required

Executive Summary

Very Large and/or computationally complex optimization problems sometimes require parallel or high performance computing for achieving a reasonable time for computation. One of the most popular and most complicate problems of this family is "Traveling Salesman Problem". In this paper the authors have introduced a Branch & Bound based algorithm for the solution of such complicated problems. The main focus of the algorithm is to solve the "Symmetric traveling salesman problem". The authors reviewed some of already available algorithms and felt that there is need of new algorithm which should give optimal solution or near to the optimal solution.

  • Format: PDF
  • Size: 769.2 KB