Abstract

A parallel algorithm for solving TSP(traveling salesman problem) is presented in this paper. Combining 2-opt local search optimization with genetic algorithm is the main ideal of this algorithm. In this paper, MPI+TBB hybrid parallel programming model is employed in implement of our algorithm. Numerical results indicate that it is possible to arrive at high quality solutions in reasonable time. With the increase in the scale of solving problem, the speedup of parallel algorithm is improved. Moreover, with the growth in the number of cores, the speedup of the parallel algorithm presents nearly linear growth.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call