A heterogeneous cooperative parallel search of branch‐and‐bound method and tabu search algorithm

In this study, we present a heterogeneous cooperative parallel search that integrates branch‐and‐bound method and tabu search algorithm. These two algorithms perform searches in parallel and cooperate by asynchronously exchanging information about the best solutions found and new initial solutions for tabu search. The rapid production of a good solution from the tabu search process provides the branch‐and‐bound process with a better feasible solution to accelerate the elimination of subproblems that do not contain an optimal solution. The new initial solution produced from the subproblem with a least‐cost lower bound of the branch‐and‐bound method suggests the best potential area for tabu search to explore. We use a master‐slave model to reduce the complexity of communication and enhance the performance of data exchange. A branch‐and‐bound process is used as the master process to control the exchange of information and the termination of computation. Several tabu search processes are executed simultaneously as the slave processes and cooperate by asynchronously exchanging information on the best solutions found and the new initial solutions by the master process of branch‐and‐bound. Based on the computation experiments of solving traveling salesman problems (TSP), the proposed heterogeneous parallel search algorithm outperforms a conventional parallel branch‐and‐bound method and a conventional parallel tabu search. We also present the computational results showing the efficiency of heterogeneous cooperative parallel search when we use more processors to accelerate search time. Thus, the proposed heterogeneous parallel search algorithm achieves linear accelerations.