Product Description
An Efficient Multicore based Parallel Computing Approach for TSP Problems
Abstract— TSP (Travelling Salesman Problem) is a typical problem in the scientific and business computing applications such as social network analysis, VLSI chip design, etc. However TSP is regarded as not only a combinatorial optimization problem but also a typical NP-hard problem, and becomes an important method of verifying the correctness and feasibility of new algorithms. Branch and bound algorithm is used to solve TSP because of accuracy results and efficient cutting branch strategy, which has great room for development. However, branch and bound algorithm has its own shortcomings, e.g. acceleration effect is not obvious or even failure for large-scale TSP on single core < In experiment, when the node number is greater than 13, we cannot get the result >; algorithm is more complex and has a bad effect on implementation and practical application. Parallel branch and bound algorithm based on < Final Year Projects 2016 >multicore has been improved and proposed to solve classic TSP for the two shortcomings. It estimates the bound by limit method according to greedy algorithm and minimum of distance matrix. The parallel algorithm draws on the implicit parallelism of branch and bound algorithm to propose a multi-branch parallel mechanism to improve the optimization efficiency.
Including Packages
Our Specialization
Support Service
Statistical Report
satisfied customers
3,589Freelance projects
983sales on Site
11,021developers
175+
There are no reviews yet