Skip to Main content Skip to Navigation
Journal articles

Hierarchical branch and bound algorithm for computational Grids

Abstract : Branch and Bound (B&B) algorithms are efficiently used for exact resolution of combinatorial optimization problems (COPs). They are easy to parallelize using the Master/Worker paradigm (MW) but limited in scalability when solving large instances of COPs on large scale environments such as computational grids. Indeed, the master process rapidly becomes a bottleneck. In this paper, we propose a new approach H-B&B for parallel B&B based on a hierarchical MW paradigm in order to deal with the scalability issue of the traditional MW-based B&B. The hierarchy is built dynamically and evolves over time according to the dynamic acquisition of computing nodes. The inner nodes of the hierarchy (masters) perform branching operations to generate sub-trees and the leaves (workers) perform a complete exploration of these sub-trees. Therefore, in addition to the parallel exploration of sub-trees, a parallel branching is adopted. H-B&B is applied to the Flow-Shop scheduling problem. Unlike most existing grid-based B&B algorithms, H-B&B has been experimented on a real computational grid (Grid’5000). The results demonstrate the scalability and efficiency of H-B&B.
Complete list of metadata
Contributor : Talbi El-Ghazali <>
Submitted on : Monday, November 12, 2012 - 9:53:45 AM
Last modification on : Wednesday, April 14, 2021 - 9:37:10 AM



Ahcène Bendjoudi, Nouredine Melab, El-Ghazali Talbi. Hierarchical branch and bound algorithm for computational Grids. Future Generation Computer Systems, Elsevier, 2012, 28 (8), pp.1168-1176. ⟨10.1016/j.future.2012.03.001⟩. ⟨hal-00750691⟩



Record views