Parallelization of local search for Euclidean Steiner tree problem

The Euclidean Steiner tree problem is to find the tree with minimal Euclidean length spanning a given fixed points in the plane, allowing the addition of auxiliary points known as Steiner points. Parallel implementations of local search algorithm are an effective technique to speed up the search for a solution of Steiner tree problem. This technique not only allows to solve larger Steiner tree problem or to find improved solutions with respect to their sequential counterparts, but also it leads to further robustness in the algorithm. In this paper, we concentrate on the problem of finding a Euclidean Steiner tree using parallel local search technique. The main contribution of this work is the O(n2 log2 n+log n log(n/log n)) parallel local search algorithm for computing Steiner tree on the Euclidean plane. The main advantage of the algorithm is that it does not need synchronization. As a result, it has no communication overhead.

[1]  Celso C. Ribeiro,et al.  Local search with perturbations for the prize‐collecting Steiner tree problem in graphs , 2001, Networks.

[2]  Kunihiko Sadakane,et al.  Neighborhood Composition: A Parallelization of Local Search Algorithms , 2004, PVM/MPI.

[3]  D. T. Lotarev,et al.  Local Optimization in the Steiner Problem on the Euclidean Plane , 2004 .

[4]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[5]  D. T. Lee,et al.  On k-Nearest Neighbor Voronoi Diagrams in the Plane , 1982, IEEE Transactions on Computers.

[6]  Celso C. Ribeiro,et al.  A Parallel GRASP for the Steiner Problem in Graphs , 1998, IRREGULAR.

[7]  Larry Rudolph,et al.  A Complexity Theory of Efficient Parallel Algorithms , 1990, Theor. Comput. Sci..

[8]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[9]  Jean-Marc Geib,et al.  Parallel adaptive tabu search for large optimization problems , 1997 .

[10]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[11]  Celso C. Ribeiro,et al.  Performance evaluation of a parallel tabu search task scheduling algorithm , 2000, Parallel Comput..

[12]  Hans Jürgen Prömel,et al.  The Steiner Tree Problem , 2002 .

[13]  Jean-Marc Geib,et al.  A parallel adaptive tabu search approach , 1998, Parallel Comput..

[14]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[15]  Celso C. Ribeiro,et al.  A Parallel Grasp for the Steiner Tree Problem in Graphs Using a Hybrid Local Search Strategy , 2000, J. Glob. Optim..

[16]  Erick Cantu-paz,et al.  Implementing Fast and Flexible Parallel Genetic Algorithms , 1998, Practical Handbook of Genetic Algorithms.

[17]  Marco Tomassini,et al.  A Parallel Genetic Programming Tool Based on PVM , 1999, PVM/MPI.