Name
Abstract | ||
|---|---|---|
Optimization tasks are often complex, CPU-time consuming and usually deal with finding the best (or good enough) solution among alternatives for a given problem. Parallel metaheuristics have been used in many real-world and scientific applications to efficiently solve these kind of problems. Local Search (LS) is an essential component for some metaheuristics and, very often, represents the dominant computational effort accomplished by an algorithm. Several metaheuristic approaches try to adapt traditional LS models to parallel platforms without considering the intrinsic features of the available architectures. In this work, we present a novel local search strategy, so-called Distributed Variable Neighborhood Descent (DVND), specially designed for CPU and multi-GPU environment. Furthermore, a new neighborhood search strategy, so-called Multi Improvement, is introduced, taking advantage of GPU massive parallelism in order to boost up LS procedures. A hard combinatorial problem is considered as case of study, the Minimum Latency Problem (MLP). For tackling this problem, a hybrid metaheuristic algorithm is considered, which combines good quality initial solutions, generated by a Greedy Randomized Adaptive Search Procedures, with a flexible and powerful refinement procedure, inside the scope of an Iterated Local Search. The DVND was compared to the classic local search procedures, producing results that outperformed the best known sequential algorithm found in the literature. The speedups ranged from 7.3 to 13.7, for the larger MLP instances with 500 to 1000 clients. Results demonstrate the effectiveness of the proposed techniques in terms of solution quality, performance and scalability. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.jpdc.2017.06.011 | Journal of Parallel and Distributed Computing |
Keywords | Field | DocType |
Multi-GPU,Parallel metaheuristic,Local search,Minimum latency problem,VND,GRASP,ILS | Mathematical optimization,Guided Local Search,Parallel metaheuristic,Computer science,Local search (optimization),Greedy randomized adaptive search procedure,Sequential algorithm,Tabu search,Iterated local search,Metaheuristic | Journal |
Volume | Issue | ISSN |
111 | C | 0743-7315 |
Citations | PageRank | References |
2 | 0.39 | 19 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Eyder Rios | 1 | 4 | 1.45 |
| Luiz Satoru Ochi | 2 | 474 | 34.62 |
| Cristina Boeres | 3 | 213 | 21.17 |
| V. N. Coelho | 4 | 51 | 9.93 |
| I. M. Coelho | 5 | 58 | 12.95 |
| Ricardo C. Farias | 6 | 136 | 14.74 |