An Implementation of a Parallel Generalized Branch and Bound Template
Journal Title: Mathematical Modelling and Analysis - Year 2007, Vol 12, Issue 3
Abstract
Branch and bound (BnB) is a general algorithm to solve optimization problems. We present a template implementation of the BnB paradigm. A BnB template is implemented using C++ object oriented paradigm. MPI is used for underlying communications. A paradigm of domain decomposition (data parallelization) is used to construct a parallel algorithm. To obtain a better load balancing, the BnB template has the load balancing module that allows the redistribution of search spaces among the processors at run time. A parallel version of user's algorithm is obtained automatically. A new derivative-free global optimization algorithm is proposed for solving nonlinear global optimization problems. It is based on the BnB algorithm and its implementation is done by using the developed BnB algorithm template library. The robustness of the new algorithm is demonstrated by solving a selection of test problems.
Authors and Affiliations
M. Baravykaitė , R. Čiegis
Keywords
Related Articles
- EP ID EP82941
- DOI 10.3846/1392-6292.2007.12.277-28
- Views 117
- Downloads 0
Identification of Microstructured Materials by Phase and Group Velocities
An inverse problem to determine parameters of microstructured solids by means of group and phase velocities of wave packets is studied. It is proved that in the case of normal dispersion the physical solution is unique a...
Two-Sample Problems in Statistical Data Modelling
A common problem in mathematical statistics is to check whether two samples differ from each other. From modelling point of view it is possible to make a statistical test for the equality of two means or alternatively tw...
Genetic Algorithm-based Calibration of Reduced Order Galerkin Models
Low-dimensional models, allowing quick prediction of fluid behaviour, are key enablers of closed-loop flow control. Reduction of the model's dimension and inconsistency of high-fidelity data set and the reduced-order for...
Positive Solutions Bifurcating from Zero Solution in a Predator-Prey Reaction–Diffusion System
An elliptic system subject to the homogeneous Dirichlet boundary con- dition denoting the steady-state system of a two-species predator-prey reaction– diffusion system with the modified Leslie–Gower and Holling-type II s...
A New Strategy for Choosing the Chebyshev-Gegenbauer Parameters in a Reconstruction Based on Asymptotic Analysis
The Gegenbauer reconstruction method, first proposed by Gottlieb et. al. in 1992, has been considered a useful technique for re-expanding finite series polynomial approximations while simultaneously avoiding Gibbs artifa...