旅行商问题的并行实现与分析
Travelling Salesman Problem: Parallel Implementations & Analysis
摘要:
旅行商问题(Traveling Salesman Problem,简称TSP)是计算机科学和运筹学领域的经典算法问题。这是一个NP-Hard优化问题。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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。