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

DOI10.1016/J.ENDM.2017.03.007zbMath1387.90018DBLPjournals/endm/AntoniadisS17arXiv1704.05132OpenAlexW2607208577WikidataQ57780822 ScholiaQ57780822MaRDI QIDQ1687632

Angelo Sifaleras, Nikolaos Antoniadis

Publication date: 4 January 2018

Full work available at URL: https://arxiv.org/abs/1704.05132

zbMATH Keywords

parallel computingvariable neighborhood searchOpenMPOpenACCCPU-GPU computing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)

Related Items (1)

Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem

Cites Work

• Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems
• General variable neighborhood search for the multi-product dynamic lot sizing problem in closed-loop supply chain
• Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies
• MPI Parallelization of Variable Neighborhood Search
• Parallel variable neighbourhood search strategies for the cutwidth minimization problem

This page was built for publication: A hybrid CPU-GPU parallelization scheme of variable neighborhood search for inventory optimization problems