Travelling Salesman Problem: Parallel Implementations & Analysis

TL;DR

This paper explores parallel implementations of the brute force approach to the Traveling Salesman Problem, providing detailed timing analysis to evaluate performance improvements across different parallel paradigms.

Contribution

It presents a comprehensive study on parallelizing the brute force TSP, including implementation details and performance evaluation under various paradigms.

Findings

Parallel implementations significantly reduce computation time.

Performance varies depending on the parallelization paradigm used.

Detailed timing data demonstrates the efficiency gains of parallel approaches.

Abstract

The Traveling Salesman Problem (often called TSP) is a classic algorithmic problem in the field of computer science and operations research. It is an NP-Hard problem focused on optimization. TSP has several applications even in its purest formulation, such as planning, logistics, and the manufacture of microchips; and can be slightly modified to appear as a sub-problem in many areas, such as DNA sequencing. In this paper, a study on parallelization of the Brute Force approach (under several paradigms) of the Travelling Salesman Problem is presented. Detailed timing studies for the serial and various parallel implementations of the Travelling Salesman Problem have also been illustrated.