A parallel threads coordination scheme for solving combinatorial optimization problems

This paper presents a parallel approach of coordinating massive parallel threads on many-core platforms to solve combinatorial optimization problems. The parallel approach is based on heuristic search that exploits parallelism at two cascade levels: (1) search level for launching multiple searches in parallel, and (2) move level for exploring multiple solutions concurrently. Those parallel searches are coordinated during the search process and a mutation scheme is proposed to improve solution quality. The Traveling Salesman Problem is used as a case study to illustrate the effectiveness of the proposed approach. Experimental results show that the proposed technique can improve solution quality by 5.9%. Compared with a parallel CPU implementation, the proposed many-core based approach can search solutions 389.7 times faster and improve solution quality by 10.4%.

[1]  Kenji Onaga,et al.  Effects of chromosome migration on a parallel and distributed genetic algorithm , 1997, Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN'97).

[2]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[3]  Cristinel Ababei.  Speeding Up FPGA Placement via Partitioning and Multithreading , 2009, Int. J. Reconfigurable Comput..

[4]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[5]  Sanghamitra Roy,et al.  Optimizing simulated annealing on GPU: A case study with IC floorplanning , 2011, 2011 12th International Symposium on Quality Electronic Design.

[6]  Martin Burtscher,et al.  A Parallel GPU Version of the Traveling Salesman Problem , 2011 .

[7]  Xun Liu,et al.  Case Study: GPU-based implementation of sequence pair based floorplanning using CUDA , 2010, Proceedings of 2010 IEEE International Symposium on Circuits and Systems.

[8]  El-Ghazali Talbi,et al.  GPU Computing for Parallel Local Search Metaheuristic Algorithms , 2013, IEEE Transactions on Computers.