DeepAI AI Chat
Log In Sign Up

Travelling Salesman Problem: Parallel Implementations Analysis

by   Amey Gohil, et al.

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.


page 1

page 2

page 3

page 4


No-Rainbow Problem is NP-Hard

Surjective Constraint Satisfaction Problem (SCSP) is the problem of deci...

A hybrid CPU-GPU parallelization scheme of variable neighborhood search for inventory optimization problems

In this paper, we study various parallelization schemes for the Variable...

Overview and Applications of GPGPU Based Parallel Ant Colony Optimization

Ant Colony Optimization algorithm is a magnificent heuristics technique ...

Algorithmic Theory of Qubit Routing

The qubit routing problem, also known as the swap minimization problem, ...

5/4 approximation for Symmetric TSP

Travelling Salesman Problem (TSP) is one of the unsolved problems in com...

Prediction of Signal Sequences in Abiotic Stress Inducible Genes from Main Crops by Association Rule Mining

It is important to study on genes affecting to growing environment of ma...

The Problem of Correlation and Substitution in SPARQL -- Extended Version

Implementations of a standard language are expected to give same outputs...