Skip to Main content Skip to Navigation
Conference papers

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
Complete list of metadata
Contributor : Ist Rennes Connect in order to contact the contributor
Submitted on : Tuesday, April 3, 2012 - 11:56:46 AM
Last modification on : Monday, June 7, 2021 - 11:56:03 AM




Mohand Mezmaz, N. Melab, El-Ghazali 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. ⟨10.1109/PDP.2007.7⟩. ⟨hal-00684833⟩



Record views