A Grid-based Parallel Approach of the Multi-Objective Branch and Bound

Authors:
M. Mezmaz;N. Melab;E-G. Talbi
Affiliations:
UMR CNRS 8022, INRIA Futurs - DOLPHIN Project, Cedex, France;UMR CNRS 8022, INRIA Futurs - DOLPHIN Project, Cedex, France;UMR CNRS 8022, INRIA Futurs - DOLPHIN Project, Cedex, France
Venue:
PDP '07 Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing
Year:
2007

Citing 0
Cited 3

P2P design and implementation of a parallel branch and bound algorithm for grids

International Journal of Grid and Utility Computing
An adaptive hierarchical master-worker (AHMW) framework for grids-Application to B&B algorithms

Journal of Parallel and Distributed Computing
Hierarchical branch and bound algorithm for computational grids

Future Generation Computer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Branch and Bound (B&B) algorithm is one of the most used methods to solve in an exact way combinatorial optimization problems. This article focuses on the multi-objective version of this algorithm, and proposes a new parallel approach adapted to grid computing systems. This approach addresses several issues related to the characteristics of the algorithm itself and the properties of grid computing systems. Validation is performed by experimenting the approach on a bi-objective flow-shop problem instance that has never been solved exactly. Solving this instance, after several days of computation on a grid of more than 1000 processors, belonging to 7 distinct clusters, and the obtained results prove the e卤ciency of the proposed approach.