论文标题
旅行推销员问题：并行实施与分析
Travelling Salesman Problem: Parallel Implementations & Analysis
论文作者
论文摘要
旅行推销员问题（通常称为TSP）是计算机科学和运营研究领域的经典算法问题。这是一个专注于优化的NP硬性问题。 TSP即使是最纯粹的配方，例如规划，物流和微芯片的制造，也有多种应用。并且可以在许多领域（例如DNA测序）稍微修改以作为子问题出现。在本文中，提出了一项关于蛮力方法并行的研究（在几个范式下）的旅行推销员问题的研究。有关旅行推销员问题的串行和各种并行实施的详细计时研究也已得到说明。
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.
