A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems

Mohand Mezmaz 1 Nouredine Melab 1 El-Ghazali Talbi 1
1 DOLPHIN - Parallel Cooperative Multi-criteria Optimization
LIFL - Laboratoire d'Informatique Fondamentale de Lille, Inria Lille - Nord Europe
Abstract : Solving exactly large scale instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel Branch and Bound algorithm for computational grids. We consequently propose new ways to efficiently deal with some crucial issues, mainly dynamic adaptive load balancing, fault tolerance, global information sharing and termination detection of the algorithm. A special coding of the work units distributed and folded/unfolded during the exploration of the search tree allows to optimize the involved communications. The algorithm has been implemented following a large scale idle time stealing paradigm. It has been experimented on a Flow-Shop problem instance (Ta056) that has never been solved exactly. The optimal solution has been found with proof of optimality within 25 days using about 1900 processors belonging to 9 Nation-wide distinct clusters (administration domains). During the resolution, the worker processors were exploited with an average to 97% while the farmer processor was exploited only 1.7% of the time. These two rates are good indicators on the parallel efficiency of the proposed approach and its scalability.
Type de document :
[Research Report] INRIA. 2006, pp.15
Liste complète des métadonnées

Littérature citée [11 références]  Voir  Masquer  Télécharger

Contributeur : Rapport de Recherche Inria <>
Soumis le : vendredi 7 juillet 2006 - 10:42:44
Dernière modification le : jeudi 11 janvier 2018 - 01:49:32
Document(s) archivé(s) le : lundi 20 septembre 2010 - 16:23:57



  • HAL Id : inria-00083814, version 2


Mohand Mezmaz, Nouredine Melab, El-Ghazali Talbi. A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems. [Research Report] INRIA. 2006, pp.15. 〈inria-00083814v2〉



Consultations de la notice


Téléchargements de fichiers