| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5777254 | Electronic Notes in Discrete Mathematics | 2017 | 8 Pages |
Abstract
In this paper, we study various parallelization schemes for the Variable Neighborhood Search (VNS) metaheuristic on a CPU-GPU system via OpenMP and OpenACC. A hybrid parallel VNS method is applied to recent benchmark problem instances for the multi-product dynamic lot sizing problem with product returns and recovery, which appears in reverse logistics and is known to be NP-hard. We report our findings regarding these parallelization approaches and present promising computational results.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Nikolaos Antoniadis, Angelo Sifaleras,