Application of Hybrid MPI+TBB Parallel Programming Model for Traveling Salesman Problem

Author

Jinke Zhu ; Qing Li

Author_Institution

Sch. of Comput. Eng. & Sci., Shanghai Univ., Shanghai, China

fYear

2013

fDate

20-23 Aug. 2013

Firstpage

2164

Lastpage

2167

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.

Keywords

application program interfaces; genetic algorithms; mathematics computing; message passing; parallel algorithms; parallel programming; search problems; travelling salesman problems; 2-opt local search optimization; TSP; genetic algorithm; hybrid MPI-TBB parallel programming model; parallel algorithm; threading building blocks; traveling salesman problem; Computational modeling; Educational institutions; Genetic algorithms; Message systems; Parallel algorithms; Parallel programming; Traveling salesman problems; 2-opt algorithm; MPI; ThreadingBuilding Blocks; parallel genetic algorithm; traveling salesman problem;

fLanguage

English

Publisher

ieee

Conference_Titel

Green Computing and Communications (GreenCom), 2013 IEEE and Internet of Things (iThings/CPSCom), IEEE International Conference on and IEEE Cyber, Physical and Social Computing

Conference_Location

Beijing

Type

conf

DOI

10.1109/GreenCom-iThings-CPSCom.2013.408

Filename

6682418