Implementation and Use of Coarse-grained Parallel Branch-and-bound in Everest Distributed Environment

This paper examines the coarse-grained approach to parallelization of the branch-and-bound (B&B) algorithm in a distributed computing environment. This approach is based on preliminary decomposition of a feasible domain of mixed-integer programming problem into a set of subproblems. The produced...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Procedia computer science Ročník 108; s. 1532 - 1541
Hlavní autoři: Voloshinov, Vladimir, Smirnov, Sergey, Sukhoroslov, Oleg
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 2017
Témata:
algebraic modeling languages
branch-and-bound
coarse grained parallelism
distributed computing
domain decomposition
mixed-integer programming
Traveling Salesman Problem
branch-and-bound
domain decomposition
algebraic modeling languages
mixed-integer programming
coarse grained parallelism
Traveling Salesman Problem
distributed computing
ISSN:1877-0509, 1877-0509
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper examines the coarse-grained approach to parallelization of the branch-and-bound (B&B) algorithm in a distributed computing environment. This approach is based on preliminary decomposition of a feasible domain of mixed-integer programming problem into a set of subproblems. The produced subproblems are solved in parallel by a distributed pool of standalone B&B solvers. The incumbent values found by individual solvers are intercepted and propagated to other solvers to speed up the traversal of B&B search tree. Presented implementation of the approach is based on SCIP, a non-commercial MINLP solver, and Everest, a web-based distributed computing platform. The implementation was tested on several mixed-integer programming problems and a noticeable speedup has been achieved. In the paper, results of a number of experiments with the Traveling Salesman Problem are presented.
ISSN:1877-0509
1877-0509
DOI:10.1016/j.procs.2017.05.207