DeepAI AI Chat
Log In Sign Up

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

04/17/2017
by   Nikolaos Antoniadis, et al.
University of Macedonia
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

02/17/2018

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

Planning under uncertainty is critical for robust robot performance in u...
08/25/2019

OpenMP parallelization of multiple precision Taylor series method

OpenMP parallelization of multiple precision Taylor series method is pro...
11/23/2021

A Variant RSA Acceleration with Parallelization

The standard RSA relies on multiple big-number modular exponentiation op...
05/28/2022

Travelling Salesman Problem: Parallel Implementations Analysis

The Traveling Salesman Problem (often called TSP) is a classic algorithm...
10/24/2017

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...
12/21/2020

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...
09/14/2017

Parallel Enumeration of Triangulations

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