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

04/17/2017
by   Nikolaos Antoniadis, et al.
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

research
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...
research
08/25/2019

OpenMP parallelization of multiple precision Taylor series method

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

A Variant RSA Acceleration with Parallelization

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

Travelling Salesman Problem: Parallel Implementations Analysis

The Traveling Salesman Problem (often called TSP) is a classic algorithm...
research
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...
research
01/27/2022

Efficient hybrid topology optimization using GPU and homogenization based multigrid approach

We propose a new hybrid topology optimization algorithm based on multigr...
research
09/14/2017

Parallel Enumeration of Triangulations

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

Please sign up or login with your details

Forgot password? Click here to reset