Tool for Simulating Branch and Bound Computations

The paper describes a simulator of parallel Branch and Bound (BnB) method. Several subdomain trees for benchmark functions are analyzed, a characteristic Gaussian-like distribution is discovered. An algorithm of artificial tree generation is formulated according to this criterion. The process of sim...

Full description

Bibliographic Details
Main Authors: Ignatov Andrei, Gorchakov Andrei
Format: Article
Language:English
Published: De Gruyter 2020-05-01
Series:Open Computer Science
Subjects:
Online Access:https://doi.org/10.1515/comp-2020-0115
id doaj-9d2f375150ed48acb0766f7d88a2dcfb
record_format Article
spelling doaj-9d2f375150ed48acb0766f7d88a2dcfb2021-09-06T19:19:43ZengDe GruyterOpen Computer Science2299-10932020-05-0110111211610.1515/comp-2020-0115comp-2020-0115Tool for Simulating Branch and Bound ComputationsIgnatov Andrei0Gorchakov Andrei1National Research University Higher School of Economics,Moscow, Russia; Federal Research Center “Computer Science and Control” of Russian Academy of Sciences, Moscow, RussiaFederal Research Center “Computer Science and Control” of Russian Academy of Sciences, Moscow, Russia; Moscow Institute of Physics and Technology, Dolgoprudnyi, Moscow oblast, Russia; National Research University Higher School of Economics, Moscow, RussiaThe paper describes a simulator of parallel Branch and Bound (BnB) method. Several subdomain trees for benchmark functions are analyzed, a characteristic Gaussian-like distribution is discovered. An algorithm of artificial tree generation is formulated according to this criterion. The process of simulator modeling is described, several computational experiments are conducted. Their results show a hyperbolic decrease trend for modeled time as the number of computational units grows, which is concluded to be similar to real systems.https://doi.org/10.1515/comp-2020-0115branch and boundsimulatoroptimization
collection DOAJ
language English
format Article
sources DOAJ
author Ignatov Andrei
Gorchakov Andrei
spellingShingle Ignatov Andrei
Gorchakov Andrei
Tool for Simulating Branch and Bound Computations
Open Computer Science
branch and bound
simulator
optimization
author_facet Ignatov Andrei
Gorchakov Andrei
author_sort Ignatov Andrei
title Tool for Simulating Branch and Bound Computations
title_short Tool for Simulating Branch and Bound Computations
title_full Tool for Simulating Branch and Bound Computations
title_fullStr Tool for Simulating Branch and Bound Computations
title_full_unstemmed Tool for Simulating Branch and Bound Computations
title_sort tool for simulating branch and bound computations
publisher De Gruyter
series Open Computer Science
issn 2299-1093
publishDate 2020-05-01
description The paper describes a simulator of parallel Branch and Bound (BnB) method. Several subdomain trees for benchmark functions are analyzed, a characteristic Gaussian-like distribution is discovered. An algorithm of artificial tree generation is formulated according to this criterion. The process of simulator modeling is described, several computational experiments are conducted. Their results show a hyperbolic decrease trend for modeled time as the number of computational units grows, which is concluded to be similar to real systems.
topic branch and bound
simulator
optimization
url https://doi.org/10.1515/comp-2020-0115
work_keys_str_mv AT ignatovandrei toolforsimulatingbranchandboundcomputations
AT gorchakovandrei toolforsimulatingbranchandboundcomputations
_version_ 1717777978008535040