Optimal Design of Multi-product Batch Plants Using a Parallel Branch-and-Bound Method

被引：0

作者：

Borisenko, Andrey ^{[1
]}

Kegel, Philipp ^{[2
]}

Gorlatch, Sergei ^{[2
]}

机构：

[1] Tambov State Tech Univ, Tambov, Russia

[2] Univ Munster, Munster, Germany

来源：

PARALLEL COMPUTING TECHNOLOGIES | 2011年 / 6873卷

关键词：

multi-product batch plant; parallel optimization; branch-and-bound; master-worker; global optimization; MPI; OpenMP; OPTIMIZATION; ALGORITHMS;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this paper we develop and implement a parallel algorithm for a real-world application: finding optimal designs for multi-product batch plants. We describe two parallelization strategies - for systems with shared-memory and distributed-memory - based on the branch-and-bound paradigm and implement them using OpenMP (Open Multi-Processing) and MPI (Message Passing interface), correspondingly. Experimental results demonstrate that our approach provides competitive speedup on modern clusters of multi-core processors.

引用

页码：417 / +

页数：3

共 21 条

[1] Distributed computing with hierarchical master-worker paradigm for parallel branch and bound algorithm [J].