Open AccessComposite version of B&B algorithm: experimental verification of the efficiency
Author(s) -
Vitaly O. Groppen,
A. A. Berko
Publication year - 2019
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1278/1/012029
Subject(s) - branch and bound , composite number , branching (polymer chemistry) , algorithm , integer programming , computer science , dynamic programming , pruning , integer (computer science) , value (mathematics) , mathematics , mathematical optimization , programming language , materials science , agronomy , composite material , biology , machine learning
The aim of this paper is to verify the efficiency for a composite version of branch and bound algorithm combining B&B branching strategy and bounds computing with the pruning rules used in dynamic programming for selecting of direction of movement by a search tree. As criteria of efficiency we used random access memory (RAM) and time gains of finding integer programming problem solution by a composite version of branch and bound algorithm in comparison with its traditional implementation. The number of variables in the problems and restrictions did not exceed 25 and 15, respectively. Experimental verification have shown that for solving time used as a criterion of the efficiency, the advantages of composite version are beyond doubt compared to the used RAM value as criterion often taking the side of the classical B&B algorithm.