Abstract
We present a survey of parallel local search algorithms in which we review the concepts that can be used to incorporate parallelism into local search. For this purpose we distinguish between single-walk and multiple-walk parallel local search and between asynchronous and synchronous parallelism. Within the class of single-walk algorithms we differentiate between multiple-step and single-step parallelism. To describe parallel local search we introduce the concepts of hyper neighborhood structures and distributed neighborhood structures. Furthermore, we present templates that capture most of the parallel local search algorithms proposed in the literature. Finally, we discuss some complexity issues related to parallel local search.
| Original language | English |
|---|---|
| Pages (from-to) | 43-65 |
| Number of pages | 23 |
| Journal | Journal of Heuristics |
| Volume | 1 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 1995 |
| Externally published | Yes |