DeepAI AI Chat
Log In Sign Up

A hybrid CPU-GPU parallelization scheme of variable neighborhood search for inventory optimization problems

by   Nikolaos Antoniadis, et al.
University of Macedonia

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.


page 1

page 2

page 3

page 4


HyP-DESPOT: A Hybrid Parallel Algorithm for Online Planning under Uncertainty

Planning under uncertainty is critical for robust robot performance in u...

OpenMP parallelization of multiple precision Taylor series method

OpenMP parallelization of multiple precision Taylor series method is pro...

A Variant RSA Acceleration with Parallelization

The standard RSA relies on multiple big-number modular exponentiation op...

Travelling Salesman Problem: Parallel Implementations Analysis

The Traveling Salesman Problem (often called TSP) is a classic algorithm...

Hybrid Fortran: High Productivity GPU Porting Framework Applied to Japanese Weather Prediction Model

In this work we use the GPU porting task for the operative Japanese weat...

Parallel Prony's method with multivariate matrix pencil approach and its numerical aspect

Prony's method is a standard tool exploited for solving many imaging and...

Parallel Enumeration of Triangulations

We report on the implementation of an algorithm for computing the set of...