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

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, the obtained results prove the efficiency of the proposed approach
Type de document :
Communication dans un congrès
Parallel, Distributed and Network-Based Processing, PDP '07, Feb 2007, Napoli, Italy. 2007, 〈10.1109/PDP.2007.7〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00684833
Contributeur : Ist Rennes <>
Soumis le : mardi 3 avril 2012 - 11:56:46
Dernière modification le : jeudi 11 janvier 2018 - 06:20:12

Identifiants

Collections

Citation

Mohand Mezmaz, N. Melab, E.-G. Talbi. A Grid-based Parallel Approach of the Multi-Objective Branch and Bound. Parallel, Distributed and Network-Based Processing, PDP '07, Feb 2007, Napoli, Italy. 2007, 〈10.1109/PDP.2007.7〉. 〈hal-00684833〉

Partager

Métriques

Consultations de la notice

86